Back to Results
First PageMeta Content
Combinatorics / Matroid / Branch-decomposition / Submodular set function / Greedoid / Tree decomposition / Oriented matroid / Tutte polynomial / Mathematics / Graph theory / Matroid theory


Finding Branch-decompositions and Rank-decompositions Petr Hlinˇen´y ∗† Faculty of Informatics Masaryk University Botanick´a 68a, Brno, Czech Rep.
Add to Reading List

Document Date: 2008-02-12 04:44:10

Open Document

File Size: 613,17 KB

Share Result on Facebook

Country

South Korea / /

Currency

pence / /

/

Facility

University of Waterloo / Georgia Institute of Technology / /

IndustryTerm

polynomial-time algorithm / faster algorithm / decision algorithm / branch-width-testing algorithm / fixed parameter tractable algorithm / xed-parameter tractable algorithm / approximation algorithm / rst rank-width algorithm / /

Organization

X Y / Masaryk University / Petr Hlinˇen´y ∗† Faculty / University of Waterloo / National Science Foundation / Georgia Institute of Technology / Department of Mathematical Sciences KAIST / Czech Ministry of Education / /

Person

Mm / Petr Hlin / /

Position

second author was / Prime Minister / representative / /

ProvinceOrState

Utah / /

Technology

branch-width / fixed parameter tractable algorithm / faster algorithm / rst rank-width algorithm / xed-parameter tractable algorithm / approximation algorithm / branch-width-testing algorithm / decision algorithm / time algorithm / polynomial-time algorithm / /

SocialTag