Basic Terminology, Notation and Results
From MaRDI portal
Publication:3120433
DOI10.1007/978-3-319-71840-8_1zbMath1407.05101OpenAlexW1817589979MaRDI QIDQ3120433
Gregory Gutin, Jörgen Bang-Jensen
Publication date: 4 March 2019
Published in: Springer Monographs in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-71840-8_1
Directed graphs (digraphs), tournaments (05C20) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01)
Related Items (4)
Directed Steiner tree packing and directed tree connectivity ⋮ Proximity and remoteness in directed and undirected graphs ⋮ Arc-disjoint in- and out-branchings rooted at the same vertex in compositions of digraphs ⋮ Arc-disjoint strong spanning subdigraphs in compositions and products of digraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Rural postman parameterized by the number of components of required edges
- Fundamentals of parameterized complexity
- Exact exponential algorithms.
- Solving MAX-\(r\)-SAT above a tight lower bound
- FPT algorithms and kernels for the directed \(k\)-leaf problem
- The minimum spanning strong subdigraph problem is fixed parameter tractable
- On problems without polynomial kernels
- The directed subgraph homeomorphism problem
- Sur les arborescences dans un graphe oriente
- Edge-disjoint branching in directed multigraphs
- In-tournament digraphs
- Path-contractions, edge deletions and connectivity preservation
- A new view on rural postman based on Eulerian extension and matching
- The Design of Approximation Algorithms
- Kernel(s) for problems with no kernel
- Linkedness and Ordered Cycles in Digraphs
- On Finding Directed Trees with Many Leaves
- Robbins's Theorem for Mixed Multigraphs
- Tight Bounds for Graph Homomorphism and Subgraph Isomorphism
- Spanning Directed Trees with Many Leaves
- A full derandomization of schöning's k-SAT algorithm
- Parameterized Algorithms
- Digraphs
- On Subtournaments of a Tournament
- A Theorem on Graphs, with an Application to a Problem of Traffic Control
This page was built for publication: Basic Terminology, Notation and Results
