Some algorithmic results for finding compatible spanning circuits in edge-colored graphs
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1573-2886
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
Some algorithmic results for finding compatible spanning circuits in edge-colored graphs ; day:4 ; month:9 ; year:2020 ; pages:1-12
Journal of combinatorial optimization ; (4.9.2020), 1-12
- Urheber
-
Guo, Zhiwei
Broersma, Hajo
Li, Ruonan
Zhang, Shenggui
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1007/s10878-020-00644-7
- URN
-
urn:nbn:de:101:1-2020102519524757523160
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:33 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
- Guo, Zhiwei
- Broersma, Hajo
- Li, Ruonan
- Zhang, Shenggui
- SpringerLink (Online service)
Ähnliche Objekte (12)
Compatible Spanning Circuits and Forbidden Induced Subgraphs
Microstrip to waveguide transition compatible with MM-wave integrated circuits
Super-resolution laser probing of integrated circuits using algorithmic methods
Stochastic spanning
Colored Plates.
Rooted Spanning Superpixels
Cornering colored coannihilation
Bildbeschriftung: colored people
Properly Edge-colored Theta Graphs in Edge-colored Complete Graphs
Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs
Bounded degree spanning trees
Smallest color spanning objects
Compatible Spanning Circuits and Forbidden Induced Subgraphs
Microstrip to waveguide transition compatible with MM-wave integrated circuits
Super-resolution laser probing of integrated circuits using algorithmic methods
Stochastic spanning
Colored Plates.
Rooted Spanning Superpixels
Cornering colored coannihilation
Bildbeschriftung: colored people
Properly Edge-colored Theta Graphs in Edge-colored Complete Graphs
Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs
Bounded degree spanning trees
Smallest color spanning objects
Compatible Spanning Circuits and Forbidden Induced Subgraphs
Microstrip to waveguide transition compatible with MM-wave integrated circuits
Super-resolution laser probing of integrated circuits using algorithmic methods
Stochastic spanning
Colored Plates.
Rooted Spanning Superpixels
Cornering colored coannihilation
Bildbeschriftung: colored people
Properly Edge-colored Theta Graphs in Edge-colored Complete Graphs
Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs
Bounded degree spanning trees