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 proceedingConference PaperResearchpeer-review

16 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 languageEnglish
Title of host publicationGraph Drawing
Subtitle of host publication22nd International Symposium, GD 2014 Würzburg, Germany, September 24-26, 2014 Revised Selected Papers
EditorsChristian Duncan, Antonios Symvonis
Place of PublicationHeidelberg Germany
PublisherSpringer
Pages416-427
Number of pages12
ISBN (Print)9783662458020, 9783662458037
DOIs
Publication statusPublished - 2014
Externally publishedYes
EventGraph Drawing 2014 - Wurzburg, Germany
Duration: 24 Sep 201426 Sep 2014
Conference number: 22nd
https://link.springer.com/book/10.1007/978-3-662-45803-7 (Proceedings)

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Volume8871
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

ConferenceGraph Drawing 2014
Abbreviated titleGD 2014
CountryGermany
CityWurzburg
Period24/09/1426/09/14
OtherGraph Drawing: 22nd International Symposium, GD 2014
Internet address

Cite this