Vor Ort
Merkzettel Warenkorb
  • Produktbild: Graph-Theoretic Concepts in Computer Science
  • Produktbild: Graph-Theoretic Concepts in Computer Science
Band 12301

Graph-Theoretic Concepts in Computer Science 46th International Workshop, WG 2020, Leeds, UK, June 24–26, 2020, Revised Selected Papers

Aus der Reihe Theoretical Computer Science and General Issues

49,99 €

inkl. gesetzl. MwSt., Versandkostenfrei

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

16.10.2020

Abbildungen

XV, 416 p. 50 illus.

Herausgeber

Isolde Adler + weitere

Verlag

Springer

Seitenzahl

416

Maße (L/B/H)

23,5/15,5/2,4 cm

Gewicht

651 g

Auflage

1st ed. 2020

Sprache

Englisch

ISBN

978-3-030-60439-4

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

16.10.2020

Abbildungen

XV, 416 p. 50 illus.

Herausgeber

Verlag

Springer

Seitenzahl

416

Maße (L/B/H)

23,5/15,5/2,4 cm

Gewicht

651 g

Auflage

1st ed. 2020

Sprache

Englisch

ISBN

978-3-030-60439-4

Herstelleradresse

Springer-Verlag KG
Sachsenplatz 4-6
1201 Wien
AT

Email: GPSR Kontakt

Noch keine Bewertungen vorhanden

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.

Kundinnen und Kunden meinen

Bewertungen (0)
  • Produktbild: Graph-Theoretic Concepts in Computer Science
  • Produktbild: Graph-Theoretic Concepts in Computer Science

  • Combinatorial Bounds for Conflict-free Coloring on Open Neighborhoods.- Guarding Quadrangulations and Stacked Triangulations with Edges.- Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space.- Parameterized Inapproximability of Independent Set in
    H
    -Free Graphs.- Clique-Width of Point Configurations.- On the complexity of finding large odd induced subgraphs and odd colorings.- Knot Diagrams of Treewidth Two.- Treewidth versus clique number in graph classes with a forbidden structure.- Graph Isomorphism Restricted by Lists.- Clique-Width: Harnessing the Power of Atoms.- Edge elimination and weighted graph classes.- Well-partitioned chordal graphs: obstruction set and disjoint paths.- Plattenbauten: Touching Rectangles in Space Universal Geometric Graphs.- Computing Subset Transversals in H-Free Graphs.- Feedback Edge Sets in Temporal Graphs.- On flips in planar matchings.- Degree Distribution for Duplication-Divergence Graphs: Large Deviations.- On Finding Balanced Bicliques via Matchings.- Finding large matchings in 1-planar graphs of minimum degree 3.- Strong cliques in diamond-free graphs.- Recognizing
    k
    -Clique Extendible Orderings.- Linear-Time Recognition of Double-Threshold Graphs.- Characterization and Linear-time Recognition of Paired Threshold Graphs.- Drawing Graphs as Spanners.- Inserting one edge into a simple drawing is hard.- Bitonic st-orderings for Upward Planar Graphs: The Variable Embedding Setting.- 2.5-Connectivity: Unique Components, Critical Graphs, and Applications Stable Structure on Safe Set Problems in Vertex-weighted Graphs II – Recognition and Complexity.- The linear arboricity conjecture for 3-degenerate graphs.- Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-width.- Weighted Additive Spanners.