Maximum Independent Set in 2-Direction Outersegment Graphs

Holger Flier; Matúš Mihalák; Peter Widmayer; Anna Zych

doi:10.1007/978-3-642-25870-1_15

Maximum Independent Set in 2-Direction Outersegment Graphs

Holger Flier, Matúš Mihalák, Peter Widmayer, Anna Zych

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

Abstract

An outersegment graph is the intersection graph of line-segments lying inside a disk and having one end-point on the boundary of the disk. We present a polynomial-time algorithm for the problem of computing a maximum independent set in outersegment graphs where every segment is either horizontally or vertically aligned. We assume that a geometric representation of the graph is given as input.

Original language	English
Title of host publication	Proceedings of the 37th International Workshop on Graph-Theoretic Concepts in Computer Science (WG)
Pages	155-166
Number of pages	12
DOIs	https://doi.org/10.1007/978-3-642-25870-1_15
Publication status	Published - 2011
Externally published	Yes

Access to Document

10.1007/978-3-642-25870-1_15

Cite this

@inproceedings{956df051e6cc4d6cb8187b830f062503,

title = "Maximum Independent Set in 2-Direction Outersegment Graphs",

abstract = "An outersegment graph is the intersection graph of line-segments lying inside a disk and having one end-point on the boundary of the disk. We present a polynomial-time algorithm for the problem of computing a maximum independent set in outersegment graphs where every segment is either horizontally or vertically aligned. We assume that a geometric representation of the graph is given as input.",

author = "Holger Flier and Mat{\'u}{\v s} Mihal{\'a}k and Peter Widmayer and Anna Zych",

year = "2011",

doi = "10.1007/978-3-642-25870-1_15",

language = "English",

isbn = "978-3-642-25869-5",

pages = "155--166",

booktitle = "Proceedings of the 37th International Workshop on Graph-Theoretic Concepts in Computer Science (WG)",

}

TY - GEN

T1 - Maximum Independent Set in 2-Direction Outersegment Graphs

AU - Flier, Holger

AU - Mihalák, Matúš

AU - Widmayer, Peter

AU - Zych, Anna

PY - 2011

Y1 - 2011

N2 - An outersegment graph is the intersection graph of line-segments lying inside a disk and having one end-point on the boundary of the disk. We present a polynomial-time algorithm for the problem of computing a maximum independent set in outersegment graphs where every segment is either horizontally or vertically aligned. We assume that a geometric representation of the graph is given as input.

AB - An outersegment graph is the intersection graph of line-segments lying inside a disk and having one end-point on the boundary of the disk. We present a polynomial-time algorithm for the problem of computing a maximum independent set in outersegment graphs where every segment is either horizontally or vertically aligned. We assume that a geometric representation of the graph is given as input.

U2 - 10.1007/978-3-642-25870-1_15

DO - 10.1007/978-3-642-25870-1_15

M3 - Conference article in proceeding

SN - 978-3-642-25869-5

SP - 155

EP - 166

BT - Proceedings of the 37th International Workshop on Graph-Theoretic Concepts in Computer Science (WG)

ER -