Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights

Research output: Contribution to journal › Article › Academic › peer-review

Original language	Undefined/Unknown
Pages (from-to)	811-846
Number of pages	36
Journal	Journal of Graph Algorithms and Applications
Volume	16
DOIs	https://doi.org/10.7155/jgaa.00279
Publication status	Published - 2012

Jansen12
Algorithm Theory - SWAT 2012 - 13th Scandinavian Symposium and Workshops

Access to Document

@article{5042b6e92df24f95b8013fe3dc803e56,

title = "Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights",

author = "B.M.P. Jansen",

note = "Jansen12 Algorithm Theory - SWAT 2012 - 13th Scandinavian Symposium and Workshops",

year = "2012",

doi = "10.7155/jgaa.00279",

language = "Undefined/Unknown",

volume = "16",

pages = "811--846",

journal = "Journal of Graph Algorithms and Applications",

issn = "1526-1719",

publisher = "Brown University",

}

TY - JOUR

T1 - Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights

AU - Jansen, B.M.P.

N1 - Jansen12 Algorithm Theory - SWAT 2012 - 13th Scandinavian Symposium and Workshops

PY - 2012

Y1 - 2012

U2 - 10.7155/jgaa.00279

DO - 10.7155/jgaa.00279

M3 - Article

SN - 1526-1719

VL - 16

SP - 811

EP - 846

JO - Journal of Graph Algorithms and Applications

JF - Journal of Graph Algorithms and Applications

ER -