๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

[Lecture Notes in Computer Science] Parameterized and Exact Computation Volume 5917 || An Exact Algorithm for the Maximum Leaf Spanning Tree Problem

โœ Scribed by Chen, Jianer; Fomin, Fedor V.


Book ID
120230952
Publisher
Springer Berlin Heidelberg
Year
2009
Weight
220 KB
Category
Article
ISBN
3642112692

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


[Lecture Notes in Computer Science] Para
โœ Chen, Jianer; Fomin, Fedor V. ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Springer Berlin Heidelberg ๐ŸŒ German โš– 230 KB

This Book Constitutes The Refereed Best Selected Papers Of The 4th International Workshop On Parameterized And Exact Computation, Iwpec 2009, Held In Copenhagen, Denmark, In September 2009. The 25 Revised Full Papers Presented Together With 2 Invited Talks Were Carefully Reviewed And Selected From 5

[Lecture Notes in Computer Science] Para
โœ Chen, Jianer; Fomin, Fedor V. ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Springer Berlin Heidelberg ๐ŸŒ German โš– 293 KB

This Book Constitutes The Refereed Best Selected Papers Of The 4th International Workshop On Parameterized And Exact Computation, Iwpec 2009, Held In Copenhagen, Denmark, In September 2009. The 25 Revised Full Papers Presented Together With 2 Invited Talks Were Carefully Reviewed And Selected From 5

[Lecture Notes in Computer Science] Para
โœ Downey, Rod; Fellows, Michael; Dehne, Frank ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Springer Berlin Heidelberg ๐ŸŒ German โš– 207 KB

This Book Constitutes The Refereed Proceedings Of The First International Workshop On Parameterized And Exact Computation, Iwpec 2004, Held In Bergen, Norway, In September 2004. The 25 Revised Full Papers Presented Together With An Invited Paper Were Carefully Reviewed And Selected From 47 Submissio