Algorithms for k-internal out-branching

Meirav Zehavi

doi:https://doi.org/10.1007/978-3-319-03898-8_30

Algorithms for k-internal out-branching

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

The k-Internal Out-Branching (k-IOB) problem asks if a given directed graph has an out-branching (i.e., a spanning tree with exactly one node of in-degree 0) with at least k internal nodes. The k-Internal Spanning Tree (k-IST) problem is a special case of k-IOB, which asks if a given undirected graph has a spanning tree with at least k internal nodes. We present an O*(4 ^k) time randomized algorithm for k-IOB, which improves the O* running times of the best known algorithms for both k-IOB and k-IST. Moreover, for graphs of bounded degree Δ, we present an O*(2 ^{(2-Δ+1/Δ(Δ-1))k}) time randomized algorithm for k-IOB. Both our algorithms use polynomial space.

Original language	American English
Title of host publication	Parameterized and Exact Computation - 8th International Symposium, IPEC 2013, Revised Selected Papers
Pages	361-373
Number of pages	13
DOIs	https://doi.org/10.1007/978-3-319-03898-8_30
State	Published - 1 Dec 2013
Externally published	Yes
Event	8th International Symposium on Parameterized and Exact Computation, IPEC 2013 - Sophia Antipolis, France Duration: 4 Sep 2013 → 6 Sep 2013

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	8246 LNCS

Conference

Conference	8th International Symposium on Parameterized and Exact Computation, IPEC 2013
Country/Territory	France
City	Sophia Antipolis
Period	4/09/13 → 6/09/13

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
General Computer Science

Access to Document

https://doi.org/10.1007/978-3-319-03898-8_30

Cite this

Zehavi, M. (2013). Algorithms for k-internal out-branching. In Parameterized and Exact Computation - 8th International Symposium, IPEC 2013, Revised Selected Papers (pp. 361-373). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8246 LNCS). https://doi.org/10.1007/978-3-319-03898-8_30

@inproceedings{a6c1d58da51341bdb1428b5be2bce621,

title = "Algorithms for k-internal out-branching",

abstract = "The k-Internal Out-Branching (k-IOB) problem asks if a given directed graph has an out-branching (i.e., a spanning tree with exactly one node of in-degree 0) with at least k internal nodes. The k-Internal Spanning Tree (k-IST) problem is a special case of k-IOB, which asks if a given undirected graph has a spanning tree with at least k internal nodes. We present an O*(4 k) time randomized algorithm for k-IOB, which improves the O* running times of the best known algorithms for both k-IOB and k-IST. Moreover, for graphs of bounded degree Δ, we present an O*(2 (2-Δ+1/Δ(Δ-1))k) time randomized algorithm for k-IOB. Both our algorithms use polynomial space.",

author = "Meirav Zehavi",

year = "2013",

month = dec,

day = "1",

doi = "https://doi.org/10.1007/978-3-319-03898-8_30",

language = "American English",

isbn = "9783319038971",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "361--373",

booktitle = "Parameterized and Exact Computation - 8th International Symposium, IPEC 2013, Revised Selected Papers",

note = "8th International Symposium on Parameterized and Exact Computation, IPEC 2013 ; Conference date: 04-09-2013 Through 06-09-2013",

}

Zehavi, M 2013, Algorithms for k-internal out-branching. in Parameterized and Exact Computation - 8th International Symposium, IPEC 2013, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 8246 LNCS, pp. 361-373, 8th International Symposium on Parameterized and Exact Computation, IPEC 2013, Sophia Antipolis, France, 4/09/13. https://doi.org/10.1007/978-3-319-03898-8_30

Algorithms for k-internal out-branching. / Zehavi, Meirav.
Parameterized and Exact Computation - 8th International Symposium, IPEC 2013, Revised Selected Papers. 2013. p. 361-373 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8246 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Algorithms for k-internal out-branching

AU - Zehavi, Meirav

PY - 2013/12/1

Y1 - 2013/12/1

N2 - The k-Internal Out-Branching (k-IOB) problem asks if a given directed graph has an out-branching (i.e., a spanning tree with exactly one node of in-degree 0) with at least k internal nodes. The k-Internal Spanning Tree (k-IST) problem is a special case of k-IOB, which asks if a given undirected graph has a spanning tree with at least k internal nodes. We present an O*(4 k) time randomized algorithm for k-IOB, which improves the O* running times of the best known algorithms for both k-IOB and k-IST. Moreover, for graphs of bounded degree Δ, we present an O*(2 (2-Δ+1/Δ(Δ-1))k) time randomized algorithm for k-IOB. Both our algorithms use polynomial space.

AB - The k-Internal Out-Branching (k-IOB) problem asks if a given directed graph has an out-branching (i.e., a spanning tree with exactly one node of in-degree 0) with at least k internal nodes. The k-Internal Spanning Tree (k-IST) problem is a special case of k-IOB, which asks if a given undirected graph has a spanning tree with at least k internal nodes. We present an O*(4 k) time randomized algorithm for k-IOB, which improves the O* running times of the best known algorithms for both k-IOB and k-IST. Moreover, for graphs of bounded degree Δ, we present an O*(2 (2-Δ+1/Δ(Δ-1))k) time randomized algorithm for k-IOB. Both our algorithms use polynomial space.

UR - http://www.scopus.com/inward/record.url?scp=84893148036&partnerID=8YFLogxK

U2 - https://doi.org/10.1007/978-3-319-03898-8_30

DO - https://doi.org/10.1007/978-3-319-03898-8_30

M3 - Conference contribution

SN - 9783319038971

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 361

EP - 373

BT - Parameterized and Exact Computation - 8th International Symposium, IPEC 2013, Revised Selected Papers

T2 - 8th International Symposium on Parameterized and Exact Computation, IPEC 2013

Y2 - 4 September 2013 through 6 September 2013

ER -

Algorithms for k-internal out-branching

Abstract

Publication series

Conference

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this