Suchergebnisse - "Fixed parameter tractable algorithm"
-
1
Autoren:
Quelle: Journal of Computational Biology. 31:360-379
Schlagwörter: Computational Biology, Algorithms, Phylogeny
Zugangs-URL: https://pubmed.ncbi.nlm.nih.gov/38117611
-
2
A Fixed-Parameter Tractable Algorithm for Counting Markov Equivalence Classes with the Same Skeleton
Autoren: Sharma, Vidya Sagar
Quelle: Proceedings of the AAAI Conference on Artificial Intelligence. 38:20532-20539
Schlagwörter: FOS: Computer and information sciences, Computer Science - Machine Learning, Artificial Intelligence (cs.AI), Computer Science - Artificial Intelligence, Computer Science - Data Structures and Algorithms, 0211 other engineering and technologies, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Machine Learning (cs.LG)
Zugangs-URL: http://arxiv.org/abs/2310.04218
-
3
Autoren: et al.
Weitere Verfasser: et al.
Quelle: SIAM Journal on Discrete Mathematics. 36:411-435
Schlagwörter: FOS: Computer and information sciences, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], Pathwidth, G.2.2, 0102 computer and information sciences, 01 natural sciences, Typical sequences, Graph theory, [MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO], [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], Parameterized algorithms, Computer Science - Data Structures and Algorithms, Cops and Robber games, Data Structures and Algorithms (cs.DS), 05C85, ddc:004, Width parameter, Graph decompositions, Graph searching
Dateibeschreibung: application/pdf
Zugangs-URL: https://drops.dagstuhl.de/opus/volltexte/2020/12930/pdf/LIPIcs-ESA-2020-64.pdf
http://arxiv.org/abs/2004.11937
https://hal.archives-ouvertes.fr/hal-03002761/document
https://hal.archives-ouvertes.fr/hal-03002761
https://drops.dagstuhl.de/opus/volltexte/2020/12930/pdf/LIPIcs-ESA-2020-64.pdf/
https://doi.org/10.4230/LIPIcs.ESA.2020.64
http://ui.adsabs.harvard.edu/abs/2020arXiv200411937M/abstract
https://arxiv.org/abs/2004.11937
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.64
https://hal.science/hal-03002761v1
https://hal.science/hal-03002761v1/document
https://doi.org/10.4230/lipics.esa.2020.64 -
4
Autoren: et al.
Quelle: SIAM Journal on Discrete Mathematics. 36:911-921
Schlagwörter: 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences
Dateibeschreibung: application/pdf
Zugangs-URL: http://wrap.warwick.ac.uk/165072/1/WRAP-
fixed -parameter -tractable -algorithm -elimination-bounded-degree-graphs-2022.pdf -
5
-
6
-
7
Autoren:
Quelle: Theory of Computing Systems. 64:62-100
-
8
-
9
Autoren: et al.
Index Begriffe: Computer science, Mathematics, Article, PeerReviewed
-
10
Autoren:
Quelle: Acta Mathematicae Applicatae Sinica. 17:494-502
Schlagwörter: 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
Dateibeschreibung: application/xml
-
11
Autoren:
Quelle: Lecture Notes in Computer Science ISBN: 9783540001584
Schlagwörter: Analysis of algorithms and problem complexity, 0102 computer and information sciences, 02 engineering and technology, Computational aspects related to convexity, 01 natural sciences, FPT Fixed parameter tractability, Layer drawings, NP-completeness, Graph drawing, Sided crossing minimization, Graph theory (including graph drawing) in computer science, 0202 electrical engineering, electronic engineering, information engineering, Level drawings, Layer crossing minimization
Dateibeschreibung: application/xml
Zugangs-URL: https://link.springer.com/content/pdf/10.1007%2F3-540-36151-0_12.pdf
https://core.ac.uk/display/33972354
https://dblp.uni-trier.de/db/conf/gd/gd2002.html#DujmovicW02
https://rd.springer.com/chapter/10.1007/3-540-36151-0_12
https://link.springer.com/content/pdf/10.1007%2F3-540-36151-0_12.pdf
https://link.springer.com/chapter/10.1007/3-540-36151-0_12 -
12
-
13
-
14
Autoren:
Quelle: IEEE/ACM Transactions on Computational Biology and Bioinformatics. 10:18-25
Schlagwörter: 0206 medical engineering, Populations and Evolution (q-bio.PE), Computational Biology, 0102 computer and information sciences, 02 engineering and technology, Quantitative Biology - Quantitative Methods, 01 natural sciences, FOS: Biological sciences, FOS: Mathematics, Mathematics - Combinatorics, Cluster Analysis, Hybridization, Genetic, Combinatorics (math.CO), Quantitative Biology - Populations and Evolution, Algorithms, Phylogeny, Quantitative Methods (q-bio.QM)
Zugangs-URL: http://arxiv.org/pdf/1207.6090
https://pubmed.ncbi.nlm.nih.gov/23702540
http://arxiv.org/abs/1207.6090
https://ieeexplore.ieee.org/document/6338921/
https://dblp.uni-trier.de/db/journals/tcbb/tcbb10.html#PiovesanK13
http://ieeexplore.ieee.org/document/6338921/
https://doi.org/10.1109/TCBB.2012.134
http://www.ncbi.nlm.nih.gov/pubmed/23702540
https://www.computer.org/csdl/trans/tb/2013/01/ttb2013010018.html -
15
Autoren:
Quelle: 2010 International Forum on Information Technology and Applications. :91-94
Schlagwörter: 0102 computer and information sciences, 01 natural sciences
-
16
Autoren:
Quelle: 2008 IEEE International Conference on Communications. :181-185
Schlagwörter: 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences
Zugangs-URL: http://dblp.uni-trier.de/db/conf/icc/icc2008.html#DrummondFG08
https://dblp.uni-trier.de/db/conf/icc/icc2008.html#DrummondFG08
http://doi.org/10.1109/ICC.2008.41
https://doi.org/10.1109/ICC.2008.41
http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000004533077
https://ieeexplore.ieee.org/document/4533077/ -
17
Autoren: Mark Weston
Quelle: Information Processing Letters. 90:267-272
-
18
Autoren: et al.
Weitere Verfasser: et al.
Schlagwörter: 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
Dateibeschreibung: application/pdf
-
19
Autoren: et al.
Weitere Verfasser: et al.
Schlagwörter: 3-manifold, quantum invariant, fixed parameter tractable algorithm, topological parameter, Gauss sums, topological quantum field theory
Dateibeschreibung: 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
-
20
Autoren:
Quelle: Proceedings of International Joint Conference on Artificial Intelligence (IJCAI 2009)
Index Begriffe: Keywords: Application scenario; Daily lives; Inherent complexity; Management applications; Management problems; Management tool; Novel algorithm; Optimal solutions; Optimisations; Prize-collecting; Real-world; Spatio-temporal; Time windows; Tractable algorithms; Tr, Conference paper
URL:
http://hdl.handle.net/1885/57529
International Joint Conference on Artificial Intelligence (IJCAI 2009)
Nájsť tento článok vo Web of Science
Full Text Finder