Výsledky vyhľadávania - Exact exponential-time algorithm

Matching cut: Kernelization, single-exponential time FPT, and exact exponential algorithms

Autori: Christian Komusiewicz Dieter Kratsch Van Bang Le a ďalší

Prispievatelia: Christian Komusiewicz Dieter Kratsch Van Bang Le a ďalší

Zdroj: Discrete Applied Mathematics. 283:44-58

Predmety: [SPI.AUTO] Engineering Sciences [physics]/Automatic, graph algorithm, decomposable graph, 0102 computer and information sciences, ddc:004, matching cut, 01 natural sciences

Popis súboru: application/pdf

Prístupová URL adresa: https://drops.dagstuhl.de/opus/volltexte/2019/10220/pdf/LIPIcs-IPEC-2018-19.pdf
https://hal.univ-lorraine.fr/hal-03242356v1
https://dblp.uni-trier.de/db/journals/dam/dam283.html#KomusiewiczKL20
https://doi.org/10.1016/j.dam.2019.12.010
https://www.sciencedirect.com/science/article/abs/pii/S0166218X19305530
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2018.19

Semi-Exact Exponential-Time Algorithms: an Experimental Study

Autori: Faisal N. Abu-Khzam Kai Wang Peter Shaw a ďalší

Zdroj: 2020 Second International Conference on Transdisciplinary AI (TransAI). :96-99

Predmety: 0102 computer and information sciences, 01 natural sciences

Prístupová URL adresa: https://researchers.cdu.edu.au/en/publications/semi-exact-exponential-time-algorithms-an-experimental-study

Moderate exponential-time algorithms for scheduling problems

Autori: T'kindt, Vincent Della Croce, Federico Liedloff, Mathieu a ďalší

Prispievatelia: T'kindt, Vincent Della Croce, Federico Liedloff, Mathieu a ďalší

Zdroj: Annals of Operations Research. 343:753-783

Predmety: 0211 other engineering and technologies, Scheduling theory, Exact algorithms, Complexity, 0102 computer and information sciences, 02 engineering and technology, [INFO] Computer Science [cs], 01 natural sciences, [INFO.INFO-RO] Computer Science [cs]/Operations Research [math.OC]

Popis súboru: application/pdf

Prístupová URL adresa: https://hdl.handle.net/11583/2979583
https://doi.org/10.1007/s10288-022-00525-1
https://hal.science/hal-03846925v1
https://doi.org/10.1007/s10288-022-00525-1

An exact exponential time algorithm for counting bipartite cliques

Autori: Kutzkov, Konstantin

Zdroj: Information Processing Letters. 112:535-539

Predmety: Exact exponential time algorithms, Counting bipartite cliques, 4. Education, 0202 electrical engineering, electronic engineering, information engineering, Analysis of algorithms, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Prístupová URL adresa: https://dblp.uni-trier.de/db/journals/ipl/ipl112.html#Kutzkov12
https://www.sciencedirect.com/science/article/pii/S0020019012001032
https://core.ac.uk/display/50526769
http://dblp.uni-trier.de/db/journals/ipl/ipl112.html#Kutzkov12

An exact exponential-time algorithm for the Directed Maximum Leaf Spanning Tree problem

Autori: Henning Fernau Daniel Binkele-Raible

Zdroj: Journal of Discrete Algorithms. 15:43-55

Predmety: Computational Theory and Mathematics, 0202 electrical engineering, electronic engineering, information engineering, Discrete Mathematics and Combinatorics, Exact exponential-time algorithms, NP-hard problems on directed graphs, Outbranching with a maximum number of leaves, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Theoretical Computer Science

Prístupová URL adresa: https://dl.acm.org/citation.cfm?id=2240536
https://www.sciencedirect.com/science/article/abs/pii/S1570866712000548
https://www.sciencedirect.com/science/article/pii/S1570866712000548
https://core.ac.uk/display/82486981

Exploiting structure to cope with NP-hard graph problems : polynomial and exponential time exact algorithms

Autori: Van-'T-Hof, Pim

Predmety: 005.3

Prístupová URL adresa: http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.512936

Exact Exponential-Time and Treewidth-Based Algorithms for Defence-like Domination Problems

Autori: Veldhuizen, M.R. Rooij, J.M.M. van (Thesis Advisor)

Témy: Master Thesis, Student Thesis

URL: https://studenttheses.uu.nl/handle/20.500.12932/36426

Coverability in VASS Revisited: Improving Rackoff's Bounds to Obtain Conditional Optimality.

Autori: Künnemann, Marvin Mazowiecki, Filip Schütze, Lia a ďalší

Zdroj: Journal of the ACM. Oct2025, Vol. 72 Issue 5, p1-27. 27p.

Predmety: MATHEMATICAL bounds, DETERMINISTIC algorithms, DECIDABILITY (Mathematical logic), HYPOTHESIS

Exact Algorithms for Terrain Guarding

Autori: Ashok, Pradeesha Fomin, Fedor V. Kolay, Sudeshna a ďalší

Prispievatelia: Ashok, Pradeesha Fomin, Fedor V. Kolay, Sudeshna a ďalší

Zdroj: ACM Transactions on Algorithms. 14:1-20

Predmety: Terrain Guarding, 13. Climate action, Art Gallery, Exponential-Time Algorithms, Terrain guarding, Exponential-time algorithms, 0102 computer and information sciences, ddc:004, 0101 mathematics, Art gallery, 01 natural sciences

Popis súboru: application/pdf

Prístupová URL adresa: https://pure.tue.nl/ws/files/108330597/Main.pdf
https://drops.dagstuhl.de/opus/volltexte/2017/7197/
http://dblp.uni-trier.de/db/conf/compgeom/compgeom2017.html#AshokFKSZ17
http://doi.org/10.1145/3186897
http://repository.ias.ac.in/123393/
https://www.narcis.nl/publication/RecordID/oai%3Apure.tue.nl%3Apublications%2F58bcab69-eace-4999-9cf6-8c5af8462c3c
https://doi.org/10.1145/3186897
https://dl.acm.org/citation.cfm?id=3186897
https://dl.acm.org/doi/10.1145/3186897
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.11

Exact and parameterized algorithms for choosability

Autori: Bliznets, Ivan Nederlof, Jesper

Zdroj: Acta Informatica vol.62 (2025) nr.2 [ISSN 0001-5903]

Témy: Article

URL: https://research-portal.uu.nl/en/publications/96654654-011e-450e-8c2d-077c26b3354d
https://research-portal.uu.nl/ws/files/265912259/s00236-025-00492-0.pdf
https://research-portal.uu.nl/ws/files/265912259/s00236-025-00492-0.pdf

Matching Cut: Kernelization, Single-Exponential Time FPT, and Exact Exponential Algorithms

Autori: Komusiewicz, Christian Kratsch, Dieter Le, Van Bang

Témy: matching cut, decomposable graph, graph algorithm, Data processing Computer science, InProceedings, publishedVersion

Split Vertex Deletion meets Vertex Cover: New fixed-parameter and exact exponential-time algorithms

Autori: Marcin Pilipczuk Marek Cygan

Zdroj: Information Processing Letters. 113:179-182

Predmety: 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Prístupová URL adresa: https://www.sciencedirect.com/science/article/abs/pii/S0020019013000069
http://www.sciencedirect.com/science/article/pii/S0020019013000069
https://dblp.uni-trier.de/db/journals/ipl/ipl113.html#CyganP13

Approximate and Exact Optimization Algorithms for the Beltway and Turnpike Problems with Duplicated, Missing, Partially Labeled, and Uncertain Measurements

Autori: C.S. Elder Minh Hoang Mohsen Ferdosi a ďalší

Zdroj: J Comput Biol

Predmety: Computational Biology, Humans, Research Articles, Algorithms

Prístupová URL adresa: https://pubmed.ncbi.nlm.nih.gov/39387260

Exact Algorithm for coupling maintenance-production: a bilevel approach

Autori: Schau, Quentin Ploton, Olivier T'kindt, Vincent a ďalší

Prispievatelia: Schau, Quentin Ploton, Olivier T'kindt, Vincent a ďalší

Predmety: exact algorithms, bilevel scheduling, industrie 4.0, [INFO.INFO-RO] Computer Science [cs]/Operations Research [math.OC]

Prístupová URL adresa: https://hal.science/hal-05285240v1

Exact exponential-time algorithms for finding bicliques

Autori: Daniel Binkele-Raible Henning Fernau Serge Gaspers a ďalší

Zdroj: Information Processing Letters. 111:64-67

Predmety: 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Prístupová URL adresa: http://www.dim.uchile.cl/%7Esgaspers/papers/NonInducedBicliques.pdf

An Exact Exponential Time Algorithm for Power Dominating Set

Autori: Henning Fernau Daniel Binkele-Raible

Zdroj: Algorithmica. 63:323-346

Predmety: 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Prístupová URL adresa: https://dblp.uni-trier.de/db/journals/algorithmica/algorithmica63.html#Binkele-RaibleF12
https://rd.springer.com/article/10.1007/s00453-011-9533-2
https://link.springer.com/content/pdf/10.1007%2Fs00453-011-9533-2.pdf
https://link.springer.com/article/10.1007/s00453-011-9533-2
http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica63.html#Binkele-RaibleF12

Treewidth Parameterized by Feedback Vertex Number

Autori: Molter, Hendrik Zehavi, Meirav Zivan, Amit a ďalší

Prispievatelia: Molter, Hendrik Zehavi, Meirav Zivan, Amit a ďalší

Predmety: FOS: Computer and information sciences, Single Exponential Time, Dynamic Programming, Data Structures and Algorithms, Discrete Mathematics (cs.DM), Discrete Mathematics, Treewidth, Tree Decomposition, Data Structures and Algorithms (cs.DS), ddc:004, Exact Algorithms, Feedback Vertex Number

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2504.18302
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2025.120

Faster Exact Algorithms for Some Terminal Set Problems: Faster exact algorithms for some terminal set problems

Autori: Rajesh Chitnis Fedor V. Fomin Daniel Lokshtanov a ďalší

Zdroj: Lecture Notes in Computer Science ISBN: 9783319038971
Lecture Notes in Computer Science
Parameterized and Exact Computation
Journal of Computer and System Sciences

Predmety: Graph algorithms (graph-theoretic aspects), Analysis of algorithms and problem complexity, 0211 other engineering and technologies, multiway cut, feedback vertex set, 0102 computer and information sciences, 02 engineering and technology, exact exponential time algorithms, 01 natural sciences, terminal set problems

Popis súboru: application/xml

Prístupová URL adresa: http://www.ii.uib.no/~daniello/papers/exactMultiwayCut.pdf
https://zbmath.org/6737607
https://doi.org/10.1016/j.jcss.2017.04.003
https://rd.springer.com/chapter/10.1007/978-3-319-03898-8_14
https://link.springer.com/content/pdf/10.1007%2F978-3-319-03898-8_14.pdf
http://repository.ias.ac.in/123406/
https://link.springer.com/chapter/10.1007/978-3-319-03898-8_14
http://www.ii.uib.no/~daniello/papers/exactMultiwayCut.pdf
https://dblp.uni-trier.de/db/conf/iwpec/ipec2013.html#ChitnisFLMRS13

Exact algorithms for Kayles

Autori: Hans L. Bodlaender Dieter Kratsch Sjoerd T. Timmer a ďalší

Prispievatelia: Hans L. Bodlaender Dieter Kratsch Sjoerd T. Timmer a ďalší

Zdroj: Theoretical Computer Science. 562:165-176

Predmety: Kayles, Taverne, Independent sets, 0202 electrical engineering, electronic engineering, information engineering, Combinatorial games, Analysis of algorithms, 0102 computer and information sciences, 02 engineering and technology, Graph algorithms, 16. Peace & justice, Moderately exponential time algorithms, 01 natural sciences, Exact algorithms

Popis súboru: application/pdf

Prístupová URL adresa: https://research-portal.uu.nl/en/publications/3aaec7a8-ff7c-4ef0-8c45-1a0f96c60c3b
https://doi.org/10.1016/j.tcs.2014.09.042
https://core.ac.uk/display/39802096
https://www.sciencedirect.com/science/article/abs/pii/S0304397514007324
https://www.narcis.nl/publication/RecordID/oai%3Adspace.library.uu.nl%3A1874%2F309836
https://dblp.uni-trier.de/db/journals/tcs/tcs562.html#BodlaenderKT15
http://dspace.library.uu.nl/handle/1874/309836
https://www.sciencedirect.com/science/article/pii/S0304397514007324
https://dspace.library.uu.nl/handle/1874/309836

Exact Algorithms and Strong Exponential Time Hypothesis

Autori: Joshua R. Wang Ryan Williams

Zdroj: Encyclopedia of Algorithms ISBN: 9783642278488
Encyclopedia of Algorithms ISBN: 9781493928637