Advances on testing c-planarity of embedded flat clustered graphs*

Markus Chimani; Giuseppe Di Battista; Fabrizio Frati; Karsten Klein

doi:10.1007/978-3-662-45803-7_35

Advances on testing c-planarity of embedded flat clustered graphs*

Markus Chimani, Giuseppe Di Battista, Fabrizio Frati, Karsten Klein

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

14 Citations (Scopus)

Abstract

We show a polynomial-time algorithm for testing c-planarity of embedded flat clustered graphs with at most two vertices per cluster on each face.

Original language	English
Title of host publication	Graph Drawing
Subtitle of host publication	22nd International Symposium, GD 2014 Würzburg, Germany, September 24-26, 2014 Revised Selected Papers
Editors	Christian Duncan, Antonios Symvonis
Place of Publication	Heidelberg Germany
Publisher	Springer
Pages	416-427
Number of pages	12
ISBN (Print)	9783662458020, 9783662458037
DOIs	https://doi.org/10.1007/978-3-662-45803-7_35
Publication status	Published - 2014
Externally published	Yes
Event	Graph Drawing 2014 - Wurzburg, Germany Duration: 24 Sep 2014 → 26 Sep 2014 Conference number: 22nd https://link.springer.com/book/10.1007/978-3-662-45803-7 (Proceedings)

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer
Volume	8871
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	Graph Drawing 2014
Abbreviated title	GD 2014
Country/Territory	Germany
City	Wurzburg
Period	24/09/14 → 26/09/14
Other	Graph Drawing: 22nd International Symposium, GD 2014
Internet address	https://link.springer.com/book/10.1007/978-3-662-45803-7 (Proceedings)

Access to Document

10.1007/978-3-662-45803-7_35

Cite this

Chimani, M., Di Battista, G., Frati, F., & Klein, K. (2014). Advances on testing c-planarity of embedded flat clustered graphs*. In C. Duncan, & A. Symvonis (Eds.), Graph Drawing: 22nd International Symposium, GD 2014 Würzburg, Germany, September 24-26, 2014 Revised Selected Papers (pp. 416-427). (Lecture Notes in Computer Science ; Vol. 8871). Springer. https://doi.org/10.1007/978-3-662-45803-7_35

Chimani, Markus ; Di Battista, Giuseppe ; Frati, Fabrizio et al. / Advances on testing c-planarity of embedded flat clustered graphs*. Graph Drawing: 22nd International Symposium, GD 2014 Würzburg, Germany, September 24-26, 2014 Revised Selected Papers. editor / Christian Duncan ; Antonios Symvonis. Heidelberg Germany : Springer, 2014. pp. 416-427 (Lecture Notes in Computer Science ).

@inproceedings{30d07296456a4f21ae1626a85bbb12a7,

title = "Advances on testing c-planarity of embedded flat clustered graphs*",

abstract = "We show a polynomial-time algorithm for testing c-planarity of embedded flat clustered graphs with at most two vertices per cluster on each face.",

author = "Markus Chimani and {Di Battista}, Giuseppe and Fabrizio Frati and Karsten Klein",

year = "2014",

doi = "10.1007/978-3-662-45803-7_35",

language = "English",

isbn = "9783662458020",

series = "Lecture Notes in Computer Science ",

publisher = "Springer",

pages = "416--427",

editor = "Christian Duncan and Antonios Symvonis",

booktitle = "Graph Drawing",

note = "Graph Drawing 2014, GD 2014 ; Conference date: 24-09-2014 Through 26-09-2014",

url = "https://link.springer.com/book/10.1007/978-3-662-45803-7",

}

Chimani, M, Di Battista, G, Frati, F & Klein, K 2014, Advances on testing c-planarity of embedded flat clustered graphs*. in C Duncan & A Symvonis (eds), Graph Drawing: 22nd International Symposium, GD 2014 Würzburg, Germany, September 24-26, 2014 Revised Selected Papers. Lecture Notes in Computer Science , vol. 8871, Springer, Heidelberg Germany, pp. 416-427, Graph Drawing 2014, Wurzburg, Bavaria, Germany, 24/09/14. https://doi.org/10.1007/978-3-662-45803-7_35

Advances on testing c-planarity of embedded flat clustered graphs*. / Chimani, Markus; Di Battista, Giuseppe; Frati, Fabrizio et al.

Graph Drawing: 22nd International Symposium, GD 2014 Würzburg, Germany, September 24-26, 2014 Revised Selected Papers. ed. / Christian Duncan; Antonios Symvonis. Heidelberg Germany : Springer, 2014. p. 416-427 (Lecture Notes in Computer Science ; Vol. 8871).

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

TY - GEN

T1 - Advances on testing c-planarity of embedded flat clustered graphs*

AU - Chimani, Markus

AU - Di Battista, Giuseppe

AU - Frati, Fabrizio

AU - Klein, Karsten

N1 - Conference code: 22nd

PY - 2014

Y1 - 2014

N2 - We show a polynomial-time algorithm for testing c-planarity of embedded flat clustered graphs with at most two vertices per cluster on each face.

AB - We show a polynomial-time algorithm for testing c-planarity of embedded flat clustered graphs with at most two vertices per cluster on each face.

U2 - 10.1007/978-3-662-45803-7_35

DO - 10.1007/978-3-662-45803-7_35

M3 - Conference Paper

SN - 9783662458020

SN - 9783662458037

T3 - Lecture Notes in Computer Science

SP - 416

EP - 427

BT - Graph Drawing

A2 - Duncan, Christian

A2 - Symvonis, Antonios

PB - Springer

CY - Heidelberg Germany

T2 - Graph Drawing 2014

Y2 - 24 September 2014 through 26 September 2014

ER -

Chimani M, Di Battista G, Frati F, Klein K. Advances on testing c-planarity of embedded flat clustered graphs*. In Duncan C, Symvonis A, editors, Graph Drawing: 22nd International Symposium, GD 2014 Würzburg, Germany, September 24-26, 2014 Revised Selected Papers. Heidelberg Germany: Springer. 2014. p. 416-427. (Lecture Notes in Computer Science ). https://doi.org/10.1007/978-3-662-45803-7_35