Enumerating Minimal Tropical Connected Sets
From MaRDI portal
Publication:2971136
DOI10.1007/978-3-319-51963-0_17zbMath1450.05041OpenAlexW2568614039MaRDI QIDQ2971136
Mohamed Yosri Sayadi, Dieter Kratsch, Mathieu Liedloff
Publication date: 4 April 2017
Published in: SOFSEM 2017: Theory and Practice of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-51963-0_17
Applications of graph theory (05C90) Enumeration in graph theory (05C30) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Minimal dominating sets in graph classes: combinatorial bounds and enumeration
- Enumerating minimal subset feedback vertex sets
- On the number of minimal dominating sets on some graph classes
- Exact exponential algorithms.
- On the minimum feedback vertex set problem: Exact and enumeration algorithms
- Algorithmic graph theory and perfect graphs
- Subset feedback vertex sets in chordal graphs
- Exact algorithms for graph homomorphisms
- Enumeration and Maximum Number of Minimal Connected Vertex Covers in Graphs
- On the Number of Minimal Separators in Graphs
- Connecting Terminals and 2-Disjoint Connected Subgraphs
- Maximum Number of Minimal Feedback Vertex Sets in Chordal Graphs and Cographs
- Exact Exponential Algorithms to Find a Tropical Connected Set of Minimum Size
- Finding Induced Subgraphs via Minimal Triangulations
- Graph Classes: A Survey
- Triangulating Vertex-Colored Graphs
- Feedback Vertex Sets in Tournaments
- Combinatorial bounds via measure and conquer
- Exact Algorithms via Monotone Local Search
- A Characterization of Certain Ptolemaic Graphs
- Research in Computational Molecular Biology
- On cliques in graphs
This page was built for publication: Enumerating Minimal Tropical Connected Sets
