Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    UID:
    almafu_BV046974401
    Format: 1 Online-Ressource : , Illustrationen, Diagramme.
    ISBN: 978-3-030-60440-0
    Series Statement: Lecture notes in computer science 12301
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 978-3-030-60439-4
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 978-3-030-60441-7
    Language: English
    Keywords: Informatik ; Diskrete Mathematik ; Algorithmus ; Datenstruktur ; Computermathematik ; Graphentheorie ; Theoretische Informatik ; Konferenzschrift ; Konferenzschrift ; Konferenzschrift ; Konferenzschrift
    URL: Volltext  (URL des Erstveröffentlichers)
    URL: Volltext  (URL des Erstveröffentlichers)
    URL: Volltext  (URL des Erstveröffentlichers)
    URL: Volltext  (URL des Erstveröffentlichers)
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    UID:
    almahu_9948595007802882
    Format: XV, 416 p. 50 illus. , online resource.
    Edition: 1st ed. 2020.
    ISBN: 9783030604400
    Series Statement: Theoretical Computer Science and General Issues ; 12301
    Content: This book constitutes the revised papers of the 46th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2020, held in Leeds, UK, in June 2020. The workshop was held virtually due to the COVID-19 pandemic. The 32 full papers presented in this volume were carefully reviewed and selected from 94 submissions. They cover a wide range of areas, aiming to present emerging research results and to identify and explore directions of future research of concepts on graph theory and how they can be applied to various areas in computer science.
    Note: 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.
    In: Springer Nature eBook
    Additional Edition: Printed edition: ISBN 9783030604394
    Additional Edition: Printed edition: ISBN 9783030604417
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    UID:
    gbv_1737521733
    Format: 1 Online-Ressource(XV, 416 p. 50 illus.)
    Edition: 1st ed. 2020.
    ISBN: 9783030604400
    Series Statement: Theoretical Computer Science and General Issues 12301
    Content: 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.
    Content: This book constitutes the revised papers of the 46th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2020, held in Leeds, UK, in June 2020. The workshop was held virtually due to the COVID-19 pandemic. The 32 full papers presented in this volume were carefully reviewed and selected from 94 submissions. They cover a wide range of areas, aiming to present emerging research results and to identify and explore directions of future research of concepts on graph theory and how they can be applied to various areas in computer science.
    Additional Edition: ISBN 9783030604394
    Additional Edition: ISBN 9783030604417
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 9783030604394
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 9783030604417
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    UID:
    b3kat_BV047022888
    Format: xv, 416 Seiten , Illustrationen, Diagramme
    ISBN: 9783030604394
    Series Statement: Lecture notes in computer science 12301
    Additional Edition: Erscheint auch als Online-Ausgabe ISBN 978-3-030-60440-0
    Language: English
    Keywords: Graphentheorie ; Theoretische Informatik ; Informatik ; Diskrete Mathematik ; Algorithmus ; Datenstruktur ; Computermathematik ; Konferenzschrift ; Konferenzschrift
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Did you mean 9783030154400?
Did you mean 9783030304409?
Did you mean 9783030304430?
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages