Advances on testing c-planarity of embedded flat clustered graphs

DC ElementWertSprache
dc.contributor.authorChimani, M.
dc.contributor.authorDi Battista, G.
dc.contributor.authorFrati, F.
dc.contributor.authorKlein, K.
dc.date.accessioned2021-12-23T16:32:55Z-
dc.date.available2021-12-23T16:32:55Z-
dc.date.issued2014
dc.identifier.issn03029743
dc.identifier.urihttps://osnascholar.ub.uni-osnabrueck.de/handle/unios/17577-
dc.description.abstractWe 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.
dc.description.sponsorshipAustralian Research CouncilAustralian Research Council,ARC,DE140100708; Research partially supported by the Australian Research Council (grant DE140100708).
dc.language.isoen
dc.publisherSpringer Verlag
dc.relation.ispartofLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
dc.subjectArtificial intelligence
dc.subjectComputer science
dc.subjectComputers, Clustered graph
dc.subjectPlanarity
dc.subjectPolynomial-time algorithms, Polynomial approximation
dc.titleAdvances on testing c-planarity of embedded flat clustered graphs
dc.typejournal article
dc.identifier.doi10.1007/978-3-662-45803-7_35
dc.identifier.scopus2-s2.0-84915785685
dc.identifier.urlhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84915785685&doi=10.1007%2f978-3-662-45803-7_35&partnerID=40&md5=3dc2eeb139f2eb5403841642d2ed6f5d
dc.description.volume8871
dc.description.startpage416
dc.description.endpage427
dcterms.isPartOf.abbreviationLect. Notes Comput. Sci.
crisitem.author.orcid0000-0002-4681-5550-
crisitem.author.netidChMa572-
Zur Kurzanzeige

Seitenaufrufe

2
Letzte Woche
0
Letzter Monat
0
geprüft am 03.06.2024

Google ScholarTM

Prüfen

Altmetric