Graph Theoretic Concepts in Computer Science 1st edition by Andreas Brandstadt, Ekkehard Kohler, Klaus Meer ISBN 303000256X 9783030002565

Graph Theoretic Concepts in Computer Science 1st edition by Andreas Brandstadt, Ekkehard Köhler, Klaus Meer – Ebook PDF Instant Download/Delivery: 303000256X, 978-3030002565
Full download Graph Theoretic Concepts in Computer Science 1st  Edition after payment

Product details:

ISBN 10:  303000256X
ISBN 13: 978-3030002565
Author:      Andreas Brandstadt, Ekkehard Köhler, Klaus Meer

Graph Theoretic Concepts in Computer Science 1st  Table of contents:

• On Dispersable Book Embeddings

---

• Characterising AT-free Graphs with BFS

---

• Edge Partitions of Optimal 2-plane and 3-plane Graphs

---

• On Minimum Connecting Transition Sets in Graphs

---

• Recognizing Hyperelliptic Graphs in Polynomial Time

---

• On Directed Feedback Vertex Set Parameterized by Treewidth

---

• Optimality Program in Segment and String Graphs

---

• Anagram-Free Chromatic Number Is Not Pathwidth-Bounded

---

• Tight Lower Bounds for the Number of Inclusion-Minimal st-Cuts

---

• Subexponential-Time and FPT Algorithms for Embedded Flat Clustered Planarity

---

• Computing Small Pivot-Minors

---

• Saving Probe Bits by Cube Domination

---

• Graph Amalgamation Under Logical Constraints

---

• -Completeness and Area-Universality

---

• Optimal General Matchings

---

• Quasimonotone Graphs

---

• Equiangular Polygon Contact Representations

---

• Temporal Graph Classes: A View Through Temporal Separators

---

• Covering a Graph with Nontrivial Vertex-Disjoint Paths: Existence and Optimization

---

• On the Relation of Strong Triadic Closure and Cluster Deletion

---

• On Perfect Linegraph Squares

---

• On Weak Isomorphism of Rooted Vertex-Colored Graphs

---

• Connected Vertex Cover for -Free Graphs

---

• Structurally Parameterized d-Scattered Set

---

• Popular Matchings of Desired Size

---

• Convexity-Increasing Morphs of Planar Graphs

---

• Treedepth Bounds in Linear Colorings

---

• An Improved FPT Algorithm for Independent Feedback Vertex Set

---

• Construction and Local Routing for Angle-Monotone Graphs

---

• Characterization and Recognition of Tree 3-Spanner Admissible Directed Path Graphs of Diameter Three

People also search for Graph Theoretic Concepts in Computer Science 1st  :

graph theoretic concepts in computer science
what is graph theory
concept of graph theory
real life graph theory examples
basics of graph theory

Tags:

Andreas Brandstadt,Ekkehard Kohler,Klaus Meer,Graph,Theoretic,Concepts,Computer,Science 1st