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

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

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 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

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

Autori: Binkele-Raible, Daniel Fernau, Henning

Zdroj: Journal of Discrete Algorithms. Aug2012, Vol. 15, p43-55. 13p.

Predmety: Algorithms, Spanning trees, Directed graphs, Measure theory, Problem solving, Polynomials

An exact exponential time algorithm for counting bipartite cliques

Autori: Konstantin Kutzkov The Pennsylvania State University CiteSeerX Archives

Prispievatelia: Konstantin Kutzkov The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.itu.dk/people/konk/papers/bc_exp.pdf.

Predmety: Analysis of algorithms, exact exponential time algorithms, counting bipartite cliques

Popis súboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.248.5569; http://www.itu.dk/people/konk/papers/bc_exp.pdf

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.248.5569
http://www.itu.dk/people/konk/papers/bc_exp.pdf

An Exact Exponential Time Algorithm for Power Dominating Set.

Autori: Binkele-Raible, Daniel Fernau, Henning

Zdroj: Algorithmica; Jun2012, Vol. 63 Issue 1/2, p323-346, 24p

Predmety: DOMINATING set, SET theory, VERTEX operator algebras, POLYNOMIALS, TREE graphs

Faster Exact and Parameterized Algorithm for Feedback Vertex Set in Bipartite Tournaments

Autori: Kumar, Mithilesh Lokshtanov, Daniel

Témy: Computer Science - Data Structures and Algorithms, text

URL: http://arxiv.org/abs/2411.02821

Ego-network segmentation via (weighted) Jaccard median

Autori: Zhong, H. (Haodi) Loukides, G. (Grigorios) Conte, A. (Alessio) a ďalší

Zdroj: IEEE Transactions on Knowledge and Data Engineering

Témy: Approximation algorithms, Ego-network, Heuristic algorithms, Jaccard median, Linear programming, Mixed integer linear programming, Segmentation, Social networking (online), Synthetic data, Upper bound, info:eu-repo/semantics/article

URL: https://ir.cwi.nl/pub/34014

Subset feedback vertex sets in chordal graphs.

Autori: Golovach, Petr A. Heggernes, Pinar Kratsch, Dieter a ďalší

Zdroj: Journal of Discrete Algorithms. May2014, Vol. 26, p7-15. 9p.

Matching Cut in Graphs with Large Minimum Degree.

Autori: Chen, Chi-Yeh Hsieh, Sun-Yuan Le, Hoang-Oanh a ďalší

Zdroj: Algorithmica; May2021, Vol. 83 Issue 5, p1238-1255, 18p

Predmety: POLYNOMIAL time algorithms, MAXIMA & minima, CUTTING stock problem, NP-hard problems, GRAPH algorithms, BIPARTITE graphs

On the Complexity of the Smallest Grammar Problem over Fixed Alphabets.

Autori: Casel, Katrin Fernau, Henning Gaspers, Serge a ďalší

Zdroj: Theory of Computing Systems; 2021, Vol. 65 Issue 2, p344-409, 66p

Predmety: GRAMMAR, NP-complete problems, NP-hard problems, ALPHABET, POLYNOMIAL time algorithms, DYNAMIC programming

Winner Determination Algorithms for Graph Games with Matching Structures.

Autori: Hanaka, Tesshu Kiya, Hironori Ono, Hirotaka a ďalší

Zdroj: Algorithmica. Mar2024, Vol. 86 Issue 3, p808-824. 17p.

Predmety: *GRAPH algorithms, *GAMES, *BIPARTITE graphs

Evolution through segmental duplications and losses: a Super-Reconciliation approach.

Autori: Delabre, Mattéo El-Mabrouk, Nadia Huber, Katharina T. a ďalší

Zdroj: Algorithms for Molecular Biology; 5/26/2020, Vol. 15 Issue 1, p1-15, 15p

Predmety: OPIOID receptors, GENE families, GENES, EVOLUTIONARY models, BIOLOGICAL evolution, PROOF of concept

Gehrlein stability in committee selection: parameterized hardness and algorithms.

Autori: Gupta, Sushmita Jain, Pallavi Roy, Sanjukta a ďalší

Zdroj: Autonomous Agents & Multi-Agent Systems; Apr2020, Vol. 34 Issue 1, p1-21, 21p

Jaccard Median for ego-network segmentation

Autori: Zhong, H. (Haodi) Loukides, G. (Grigorios) Conte, A. (Alessio) a ďalší

Témy: Ego network, Jaccard Median, Segmentation, Sequence segmentation, info:eu-repo/semantics/conferenceObject

URL: https://ir.cwi.nl/pub/32915

Faster winner determination algorithms for (Colored) Arc Kayles.

Autori: Hanaka, Tesshu Kiya, Hironori Lampis, Michael a ďalší

Zdroj: Journal of Computer & System Sciences. Mar2026, Vol. 156, pN.PAG-N.PAG. 1p.

On Independent Sets and Bicliques in Graphs.

Autori: Gaspers, Serge Kratsch, Dieter Liedloff, Mathieu

Zdroj: Algorithmica. Apr2012, Vol. 62 Issue 3/4, p637-658. 22p.

Predmety: *BIPARTITE graphs, *TURING test, *LINEAR systems, *DYNAMIC programming, *ALGORITHMS

The Rectilinear Steiner Forest Arborescence problem

Autori: Mielewczyk, Łukasz Palios, Leonidas Żyliński, Paweł

Témy: Computer Science - Computational Geometry, 68W25 (Primary) 68Q25 (Secondary), text

URL: http://arxiv.org/abs/2210.04576

Exact exponential algorithms for 3-machine flowshop scheduling problems.

Autori: Shang, Lei Lenté, Christophe Liedloff, Mathieu a ďalší

Zdroj: Journal of Scheduling; Apr2018, Vol. 21 Issue 2, p227-233, 7p

Predmety: EXPONENTIAL functions, MACHINE learning, PRODUCTION scheduling, PROBLEM solving, DYNAMIC programming

A sharp upper bound for the edge dominating number of hypergraphs with minimum degree.

Autori: Tang, Zhongzheng Diao, Zhuo

Zdroj: Journal of Combinatorial Optimization; Apr2025, Vol. 49 Issue 3, p1-16, 16p