Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters (Extended Abstract)
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F09%3A00206693" target="_blank" >RIV/00216208:11320/09:00206693 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters (Extended Abstract)
Original language description
We show a polynomial time algorithm for deciding if there is a cluster embedding for graphs with two components where all clusters have at most two components.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2009
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Graph Drawing
ISBN
978-3-642-00218-2
ISSN
—
e-ISSN
—
Number of pages
12
Pages from-to
—
Publisher name
SPRINGER-VERLAG
Place of publication
GERMANY
Event location
GERMANY
Event date
Jan 1, 2009
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000264579700012