Hochschulschrift
Cycle bases of graphs and spanning trees with many leaves : complexity results on planar and regular graphs
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Maße
-
30 cm
- Umfang
-
158 S.
- Sprache
-
Englisch
- Anmerkungen
-
graph. Darst.
Cottbus-Senftenberg, Techn. Univ., Diss., 2014 (Nicht für den Austausch)
- Schlagwort
-
Planarer Graph ; Zyklenraum ; NP-vollständiges Problem
- Urheber
- Inhaltsverzeichnis
- Rechteinformation
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Letzte Aktualisierung
-
11.06.2025, 13:58 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.
Objekttyp
- Hochschulschrift
Beteiligte
Ähnliche Objekte (12)
Cycle bases of graphs and spanning trees with many leaves - complexity results on planar and regular graphs
Asymptotic study of regular planar graphs
Distance-regular graphs
Planar Graph Drawing
Embedding spanning bounded degree graphs in randomly perturbed graphs
Regular factors in graphs
Antipodal distance-regular graphs
Regular factors in graphs
Multiscale planar graph generation
Isolation of Regular Graphs and k-Chromatic Graphs
A 3/2-approximation algorithm for finding spanning trees with many leaves in cubic graphs
Spanning structures in random graphs and hypergraphs
Cycle bases of graphs and spanning trees with many leaves - complexity results on planar and regular graphs
Asymptotic study of regular planar graphs
Distance-regular graphs
Planar Graph Drawing
Embedding spanning bounded degree graphs in randomly perturbed graphs
Regular factors in graphs
Antipodal distance-regular graphs
Regular factors in graphs
Multiscale planar graph generation
Isolation of Regular Graphs and k-Chromatic Graphs
A 3/2-approximation algorithm for finding spanning trees with many leaves in cubic graphs
Spanning structures in random graphs and hypergraphs
Cycle bases of graphs and spanning trees with many leaves - complexity results on planar and regular graphs
Asymptotic study of regular planar graphs
Distance-regular graphs
Planar Graph Drawing
Embedding spanning bounded degree graphs in randomly perturbed graphs
Regular factors in graphs
Antipodal distance-regular graphs
Regular factors in graphs
Multiscale planar graph generation
Isolation of Regular Graphs and k-Chromatic Graphs
A 3/2-approximation algorithm for finding spanning trees with many leaves in cubic graphs