DC FieldValueLanguage
dc.contributor.authorDornemann, Jorin-
dc.contributor.authorSchrader, Rainer-
dc.date.accessioned2021-02-11T13:50:21Z-
dc.date.available2021-02-11T13:50:21Z-
dc.date.issued2021-11-15-
dc.identifier.citationDiscrete Applied Mathematics 303: 57-65 (2021-11-15)de_DE
dc.identifier.issn0166-218Xde_DE
dc.identifier.urihttp://hdl.handle.net/11420/8765-
dc.description.abstractSeries–parallel directed graphs have been generalized in various directions. Some of these generalizations control the structure of certain emerging induced subdigraphs called N's. They allow an efficient recognition by decomposition trees. We introduce another class of directed acyclic digraphs generalizing series–parallel directed graphs with less structure of induced N's. We show that they still can be efficiently recognized by a decomposition approach. In contrast, however, to the other mentioned generalization this decomposition is not unique and does not lead to a tree but a planar graph.en
dc.language.isoende_DE
dc.relation.ispartofDiscrete applied mathematicsde_DE
dc.subjectChurch–Rosser propertyde_DE
dc.subjectDecompositionde_DE
dc.subjectDirected graphde_DE
dc.subjectSeries–parallelde_DE
dc.titleCross–series–parallel digraphsde_DE
dc.typeArticlede_DE
dc.type.diniarticle-
dcterms.DCMITypeText-
tuhh.abstract.englishSeries–parallel directed graphs have been generalized in various directions. Some of these generalizations control the structure of certain emerging induced subdigraphs called N's. They allow an efficient recognition by decomposition trees. We introduce another class of directed acyclic digraphs generalizing series–parallel directed graphs with less structure of induced N's. We show that they still can be efficiently recognized by a decomposition approach. In contrast, however, to the other mentioned generalization this decomposition is not unique and does not lead to a tree but a planar graph.de_DE
tuhh.publisher.doi10.1016/j.dam.2020.12.012-
tuhh.publication.instituteMathematik E-10de_DE
tuhh.type.opus(wissenschaftlicher) Artikel-
dc.type.driverarticle-
dc.type.casraiJournal Article-
tuhh.container.volume33de_DE
tuhh.container.startpage57de_DE
tuhh.container.endpage65de_DE
dc.identifier.scopus2-s2.0-85098510231de_DE
local.status.inpressfalsede_DE
datacite.resourceTypeJournal Article-
datacite.resourceTypeGeneralText-
item.grantfulltextnone-
item.openairecristypehttp://purl.org/coar/resource_type/c_6501-
item.creatorGNDDornemann, Jorin-
item.creatorGNDSchrader, Rainer-
item.openairetypeArticle-
item.fulltextNo Fulltext-
item.cerifentitytypePublications-
item.creatorOrcidDornemann, Jorin-
item.creatorOrcidSchrader, Rainer-
item.languageiso639-1en-
item.mappedtypeArticle-
crisitem.author.deptMathematik E-10-
crisitem.author.orcid0000-0003-3518-6039-
crisitem.author.parentorgStudiendekanat Elektrotechnik, Informatik und Mathematik-
Appears in Collections:Publications without fulltext
Show simple item record

Page view(s)

68
Last Week
0
Last month
2
checked on Aug 17, 2022

Google ScholarTM

Check

Add Files to Item

Note about this record

Cite this record

Export

Items in TORE are protected by copyright, with all rights reserved, unless otherwise indicated.