Výsledky vyhledávání - "fixed-parameter tractable algorithm"
-
1
Autoři: a další
Přispěvatelé: a další
Témata: Computational Geometry (cs.CG), FOS: Computer and information sciences, reconfiguration, Discrete Mathematics (cs.DM), fixed-parameter tractable algorithm, elimination tree, G.2.1, G.2.2, G.2.3, rotation distance, graph associahedra, combinatorial shortest path, Computer Science - Data Structures and Algorithms, FOS: Mathematics, Computer Science - Computational Geometry, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), ddc:004, 05C85, 05C10, 0C05, 90C08, 90C27, parameterized complexity, Computer Science - Discrete Mathematics
Popis souboru: application/pdf
-
2
Autoři: a další
Přispěvatelé: a další
Témata: 3-manifold, quantum invariant, fixed parameter tractable algorithm, topological parameter, Gauss sums, topological quantum field theory
Popis souboru: application/pdf
Relation: Is Part Of LIPIcs, Volume 332, 41st International Symposium on Computational Geometry (SoCG 2025); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.38
-
3
Autoři:
Přispěvatelé:
Zdroj: Journal of Scheduling. 27:119-133
Témata: Precedence constraints, [INFO.INFO-RO] Computer Science [cs]/Operations Research [math.OC], Fixed-parameter tractable algorithm, Typed task system
Popis souboru: application/pdf
-
4
Autoři: a další
Přispěvatelé: a další
Témata: quantum invariant, Computational Geometry (cs.CG), FOS: Computer and information sciences, Gauss sums, topological quantum field theory, Computational Geometry, Geometric Topology (math.GT), fixed parameter tractable algorithm, Quantum Algebra, Geometric Topology, topological parameter, FOS: Mathematics, Quantum Algebra (math.QA), ddc:004, 3-manifold
Popis souboru: application/pdf
-
5
Autoři: a další
Přispěvatelé: a další
Zdroj: ISSN: 0166-218X ; Discrete Applied Mathematics ; https://hal.science/hal-05154996 ; Discrete Applied Mathematics, 2025, 376, pp.235-250. ⟨10.1016/j.dam.2025.06.031⟩.
-
6
Autoři: a další
Přispěvatelé: a další
Zdroj: Journal of Computer and System Sciences. 86:191-206
Témata: FOS: Computer and information sciences, 05C85, 68R10, Multiway Cut, Fixed-Parameter Tractable algorithm, Digraph homomorphism, G.2.1, G.2.2, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Parameterized complexity, Principes généraux des mathématiques, Computer Science - Data Structures and Algorithms, FOS: Mathematics, 0202 electrical engineering, electronic engineering, information engineering, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), ddc:004
Popis souboru: application/pdf
Přístupová URL adresa: http://arxiv.org/abs/1509.07404
https://ui.adsabs.harvard.edu/abs/2015arXiv150907404K/abstract
https://arxiv.org/pdf/1509.07404
https://dblp.uni-trier.de/db/journals/corr/corr1509.html#KimPST15
https://arxiv.org/abs/1509.07404
https://www.sciencedirect.com/science/article/abs/pii/S002200001730003X
https://www.sciencedirect.com/science/article/pii/S002200001730003X
https://drops.dagstuhl.de/opus/volltexte/2015/5573/
https://dblp.uni-trier.de/db/conf/iwpec/ipec2015.html#0002PST15
https://hal-lirmm.ccsd.cnrs.fr/lirmm-01263999
https://hal-lirmm.ccsd.cnrs.fr/lirmm-01263999/document
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2015.78
https://pergamos.lib.uoa.gr/uoa/dl/object/3063729 -
7
Autoři: a další
Zdroj: Lecture Notes in Computer Science ISBN: 9783319286839
Témata: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), G.2.2, F.2.2, Approximation algorithm, Fixed-parameter tractable algorithm, 68R10, 05C85, Tree-cut width, Computer Science - Data Structures and Algorithms, Modèles mathématiques. Algorithmes, Data Structures and Algorithms (cs.DS), Computer Science - Discrete Mathematics
Přístupová URL adresa: http://arxiv.org/pdf/1509.04880
http://arxiv.org/abs/1509.04880
https://link.springer.com/article/10.1007/s00453-016-0245-5
https://hal.archives-ouvertes.fr/hal-01690385/document
https://hal-lirmm.ccsd.cnrs.fr/lirmm-01225569
https://link.springer.com/content/pdf/10.1007%2Fs00453-016-0245-5.pdf
https://dblp.uni-trier.de/db/journals/corr/corr1509.html#KimOPST15
https://arxiv.org/abs/1509.04880
https://link.springer.com/chapter/10.1007/978-3-319-28684-6_4
https://link.springer.com/chapter/10.1007/978-3-319-28684-6_4/fulltext.html
https://doi.org/10.1007/978-3-319-28684-6_4
https://hal-lirmm.ccsd.cnrs.fr/lirmm-01264015
http://core.ac.uk/display/29571754
https://dblp.uni-trier.de/db/conf/waoa/waoa2015.html#KimOPST15
https://ui.adsabs.harvard.edu/abs/2015arXiv150904880K/abstract
https://arxiv.org/abs/1509.04880
https://arxiv.org/pdf/1509.04880
https://pergamos.lib.uoa.gr/uoa/dl/object/3063675
https://pergamos.lib.uoa.gr/uoa/dl/object/3064058 -
8
Autoři: a další
Přispěvatelé: a další
Zdroj: ISSN: 0304-3975.
-
9
Autoři:
Zdroj: Lecture Notes in Computer Science ISBN: 9783540755197
-
10
Autoři: a další
Přispěvatelé: a další
Zdroj: ISSN: 0178-4617.
Témata: tree-cut width, Multiway Cut, Fixed-Parameter Tractable algorithm, Parameterized complexity, approximation algorithm, Digraph homomorphism, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
-
11
Autoři:
Zdroj: Journal of Discrete Algorithms. 10:70-83
Témata: Degree-constrained subgraph, Treewidth, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, Dynamic programming, 16. Peace & justice, W[1]-hardness, 01 natural sciences, Fixed-parameter tractable algorithm, Theoretical Computer Science, Parameterized complexity, Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Excluded minors
Přístupová URL adresa: https://hal-lirmm.ccsd.cnrs.fr/lirmm-00736517
http://www.sciencedirect.com/science/article/pii/S1570866711000529
https://www.sciencedirect.com/science/article/pii/S1570866711000529
http://www.lirmm.fr/~sau/Pubs/ASS11.pdf
http://repository.ias.ac.in/123458/
https://dblp.uni-trier.de/db/journals/jda/jda10.html#AminiSS12 -
12
Autoři:
Zdroj: Discrete Applied Mathematics. 159:859-865
Témata: Linear programming, Independent set, Fixed parameter tractable algorithm, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, Client–server problem, 16. Peace & justice, Approximation algorithm, 01 natural sciences, Computational geometry
-
13
Autoři: a další
Přispěvatelé: a další
Zdroj: IPEC 2015 - 10th International Symposium on Parameterized and Exact Computation ; https://hal-lirmm.ccsd.cnrs.fr/lirmm-01263999 ; IPEC 2015 - 10th International Symposium on Parameterized and Exact Computation, Sep 2015, Patras, Greece. pp.78-89, ⟨10.4230/LIPIcs.IPEC.2015.78⟩
Témata: Combinatorics, Parameterized complexity, Fixed-Parameter Tractable algorithm, Multi-way Cut, Digraph homomorphism, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
-
14
Autoři: a další
Přispěvatelé: a další
Zdroj: Encyclopedia of Algorithms, second edition. ; https://hal.archives-ouvertes.fr/hal-01299432 ; Ming-Yang Kao Encyclopedia of Algorithms, second edition., Chapitre 20, 2015, 978-3-642-27848-8. ⟨10.1007/978-3-642-27848-8_692-1⟩
Témata: Model-checking, monadic second-order logic, tree-width, clique-width, fixed parameter tractable algorithm, automaton on terms, fly-automaton, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]
Relation: hal-01299432; https://hal.archives-ouvertes.fr/hal-01299432; https://hal.archives-ouvertes.fr/hal-01299432/document; https://hal.archives-ouvertes.fr/hal-01299432/file/BC-IDsurveyEncycloAlgos.pdf
-
15
Autoři:
Zdroj: Acta Mathematicae Applicatae Sinica. 17:494-502
Témata: Analysis of algorithms and problem complexity, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, set packing, fixed-parameter-tractable algorithm, Combinatorial aspects of packing and covering, 01 natural sciences
Popis souboru: application/xml
-
16
Autoři:
Zdroj: Information Processing Letters. 73:125-129
Témata: time complexity, Analysis of algorithms and problem complexity, 0211 other engineering and technologies, Complexity classes (hierarchies, relations among complexity classes, etc.), 0102 computer and information sciences, 02 engineering and technology, FTP algorithm, 15. Life on land, fixed-parameter-tractable algorithm, 01 natural sciences
Popis souboru: application/xml
Přístupová URL adresa: https://zbmath.org/1771749
https://doi.org/10.1016/s0020-0190(00)00004-1 -
17
Autoři: a další
Přispěvatelé: a další
Témata: Fixed-parameter tractable algorithm, Modular-width, Neighborhood diversity, Parameterized complexity, W[1]-hardness
Relation: info:eu-repo/semantics/altIdentifier/isbn/978-3-030-48965-6; info:eu-repo/semantics/altIdentifier/isbn/978-3-030-48966-3; info:eu-repo/semantics/altIdentifier/wos/WOS:000916475800015; ispartofbook:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 31st International Workshop on Combinatorial Algorithms, IWOCA 2020; volume:12126; firstpage:195; lastpage:210; numberofpages:16; serie:LECTURE NOTES IN ARTIFICIAL INTELLIGENCE; http://hdl.handle.net/11386/4773603
-
18
Autoři:
Přispěvatelé:
Popis souboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.94.2272; http://www.fi.muni.cz/~hlineny/Research/papers/partition.pdf
-
19
Autoři: a další
Témata: Parameterized complexity, Fixed-Parameter Tractable algorithm, Multiway Cut, Digraph homomorphism, Principes généraux des mathématiques
Time: 511
Relation: Journal of Computer and System Sciences; 86; 2017; 191-206; Elsevier; non; oui; https://basepub.dauphine.fr/handle/123456789/20785
-
20
Autoři: a další
Přispěvatelé: a další
Zdroj: https://hal.archives-ouvertes.fr/hal-01065434 ; 2014.
Témata: recognizability, Model-checking, monadic second-order logic, tree-width, clique-width, fixed parameter tractable algorithm, automaton on terms, fly-automaton, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]
Relation: info:eu-repo/semantics/altIdentifier/arxiv/1409.5368; hal-01065434; https://hal.archives-ouvertes.fr/hal-01065434; https://hal.archives-ouvertes.fr/hal-01065434/document; https://hal.archives-ouvertes.fr/hal-01065434/file/SurveyFREC.pdf; ARXIV: 1409.5368
Nájsť tento článok vo Web of Science
Full Text Finder