Linear time algorithms for some NP-complete problems on (P_5,gem)-free graphs. (Extended abstract)

H.L. Bodlaender, A. Brandstädt, D. Kratsch, M. Rao, J. Spinrad

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

Original language	Undefined/Unknown
Title of host publication	FCT'03, Proceedings 14th International Symposium on Fundamentals of Computation Theory, Lecture Notes in Computer Science Vol. 2751
Place of Publication	Berlin
Publisher	Springer
Pages	61-72
Number of pages	12
Publication status	Published - 2003

130b

Cite this

@inproceedings{a6e1058d34d54d1ca301616412352020,

title = "Linear time algorithms for some NP-complete problems on (P_5,gem)-free graphs. (Extended abstract)",

author = "H.L. Bodlaender and A. Brandst{\"a}dt and D. Kratsch and M. Rao and J. Spinrad",

note = "130b",

year = "2003",

language = "Undefined/Unknown",

pages = "61--72",

booktitle = "FCT'03, Proceedings 14th International Symposium on Fundamentals of Computation Theory, Lecture Notes in Computer Science Vol. 2751",

publisher = "Springer",

}

Linear time algorithms for some NP-complete problems on (P_5,gem)-free graphs. (Extended abstract). / Bodlaender, H.L.; Brandstädt, A.; Kratsch, D. et al.
FCT'03, Proceedings 14th International Symposium on Fundamentals of Computation Theory, Lecture Notes in Computer Science Vol. 2751. Berlin: Springer, 2003. p. 61-72.

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

TY - GEN

T1 - Linear time algorithms for some NP-complete problems on (P_5,gem)-free graphs. (Extended abstract)

AU - Bodlaender, H.L.

AU - Brandstädt, A.

AU - Kratsch, D.

AU - Rao, M.

AU - Spinrad, J.

N1 - 130b

PY - 2003

Y1 - 2003

M3 - Conference contribution

SP - 61

EP - 72

BT - FCT'03, Proceedings 14th International Symposium on Fundamentals of Computation Theory, Lecture Notes in Computer Science Vol. 2751

PB - Springer

CY - Berlin

ER -