Advances on testing c-planarity of embedded flat clustered graphs
| Autor(en): | Chimani, M. Di Battista, G. Frati, F. Klein, K. |
Stichwörter: | Artificial intelligence; Computer science; Computers, Clustered graph; Planarity; Polynomial-time algorithms, Polynomial approximation | Erscheinungsdatum: | 2014 | Herausgeber: | Springer Verlag | Journal: | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Volumen: | 8871 | Startseite: | 416 | Seitenende: | 427 | Zusammenfassung: | 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. © Springer-Verlag Berlin Heidelberg 2014. |
ISSN: | 03029743 | DOI: | 10.1007/978-3-662-45803-7_35 | Externe URL: | https://www.scopus.com/inward/record.uri?eid=2-s2.0-84915785685&doi=10.1007%2f978-3-662-45803-7_35&partnerID=40&md5=3dc2eeb139f2eb5403841642d2ed6f5d |
Zur Langanzeige
Seitenaufrufe
2
Letzte Woche
0
0
Letzter Monat
0
0
geprüft am 21.05.2024
