Geodesic
A Parameterized Measure-and-ConquerAnalysis for Finding a k-Leaf Spanning Treein an Undirected Graph
Discrete mathematics & theoretical computer science, Tome 16 (2014) no. 1.

Voir la notice de l'article provenant de la source Episciences

Discrete Algorithms 
@article{DMTCS_2014_16_1_a11,
     author = {Binkele-Raible, Daniel and Fernau, Henning},
     title = {A {Parameterized} {Measure-and-ConquerAnalysis} for {Finding} a {k-Leaf} {Spanning} {Treein} an {Undirected} {Graph}},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {16},
     number = {1},
     year = {2014},
     doi = {10.46298/dmtcs.1256},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.1256/}
}
TY  - JOUR
AU  - Binkele-Raible, Daniel
AU  - Fernau, Henning
TI  - A Parameterized Measure-and-ConquerAnalysis for Finding a k-Leaf Spanning Treein an Undirected Graph
JO  - Discrete mathematics & theoretical computer science
PY  - 2014
VL  - 16
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.1256/
DO  - 10.46298/dmtcs.1256
LA  - en
ID  - DMTCS_2014_16_1_a11
ER  - 
%0 Journal Article
%A Binkele-Raible, Daniel
%A Fernau, Henning
%T A Parameterized Measure-and-ConquerAnalysis for Finding a k-Leaf Spanning Treein an Undirected Graph
%J Discrete mathematics & theoretical computer science
%D 2014
%V 16
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.1256/
%R 10.46298/dmtcs.1256
%G en
%F DMTCS_2014_16_1_a11
Binkele-Raible, Daniel; Fernau, Henning. A Parameterized Measure-and-ConquerAnalysis for Finding a k-Leaf Spanning Treein an Undirected Graph. Discrete mathematics & theoretical computer science, Tome 16 (2014) no. 1. doi : 10.46298/dmtcs.1256. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.1256/

Cité par Sources :