- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1573-2886
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
On characterizations for subclasses of directed co-graphs ; day:27 ; month:11 ; year:2020 ; pages:1-33
Journal of combinatorial optimization ; (27.11.2020), 1-33
- Urheber
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1007/s10878-020-00670-5
- URN
-
urn:nbn:de:101:1-2021010722192910714471
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:36 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Gurski, Frank
- Komander, Dominique
- Rehs, Carolin
- SpringerLink (Online service)
Ähnliche Objekte (12)
CHARACTERIZATIONS OF SUBCLASSES OF UNIVALENT FUNCTIONS
On subclasses of grid intersection graphs
Characterizations and Directed Path-Width of Sequence Digraphs
Directed communication in games with directed graphs
Graph isomorphism: physical resources, optimization models, and algebraic characterizations
Graph powers: hardness results, good characterizations and efficient algorithms
On layering directed acyclic graphs
DAGMA: Mining Directed Acyclic Graphs
Planarity Variants for Directed Graphs
Directed strongly walk-regular graphs
Graph sampling for subgraph counting on directed graphs
Component Order Connectivity in Directed Graphs
CHARACTERIZATIONS OF SUBCLASSES OF UNIVALENT FUNCTIONS
On subclasses of grid intersection graphs
Characterizations and Directed Path-Width of Sequence Digraphs
Directed communication in games with directed graphs
Graph isomorphism: physical resources, optimization models, and algebraic characterizations
Graph powers: hardness results, good characterizations and efficient algorithms
On layering directed acyclic graphs
DAGMA: Mining Directed Acyclic Graphs
Planarity Variants for Directed Graphs
Directed strongly walk-regular graphs
Graph sampling for subgraph counting on directed graphs
Component Order Connectivity in Directed Graphs
CHARACTERIZATIONS OF SUBCLASSES OF UNIVALENT FUNCTIONS
On subclasses of grid intersection graphs
Characterizations and Directed Path-Width of Sequence Digraphs
Directed communication in games with directed graphs
Graph isomorphism: physical resources, optimization models, and algebraic characterizations
Graph powers: hardness results, good characterizations and efficient algorithms
On layering directed acyclic graphs
DAGMA: Mining Directed Acyclic Graphs
Planarity Variants for Directed Graphs
Directed strongly walk-regular graphs
Graph sampling for subgraph counting on directed graphs