Enumeration of minimal tropical connected sets
From MaRDI portal
Publication:6057321
DOI10.1007/978-3-031-30448-4_10MaRDI QIDQ6057321
Danil Sagunov, Eugene Tagin, Ivan A. Bliznets
Publication date: 4 October 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Largest chordal and interval subgraphs faster than \(2^n\)
- On the number of minimal dominating sets on some graph classes
- Solving the 2-disjoint connected subgraphs problem faster than \(2^n\)
- Computing tree-depth faster than \(2^n\)
- Exact exponential algorithms to find tropical connected sets of minimum size
- Exact exponential algorithms.
- Minimal triangulations of graphs: a survey
- Solving connected dominating set faster than \(2^n\)
- A note on the complexity of the chromatic number problem
- Tropical dominating sets in vertex-coloured graphs
- Algorithmic graph theory and perfect graphs
- Capacitated domination faster than \(O(2^n)\)
- Enumeration of minimal connected dominating sets for chordal graphs
- Enumeration and maximum number of minimal dominating sets for chordal graphs
- Trees having many minimal dominating sets
- Tropical matchings in vertex-colored graphs
- Connecting Terminals and 2-Disjoint Connected Subgraphs
- Exact Exponential Algorithms to Find a Tropical Connected Set of Minimum Size
- Enumerating Minimal Tropical Connected Sets
- Path Contraction Faster than $2^n$
- Irredundant Set Faster Than O(2 n )
- Improved Exact Algorithms for Counting 3- and 4-Colorings
- Graph Classes: A Survey
- Combinatorial bounds via measure and conquer
- Solving Target Set Selection with Bounded Thresholds Faster than 2^n
- Hardness of Easy Problems: Basing Hardness on Popular Conjectures such as the Strong Exponential Time Hypothesis (Invited Talk)
- Parameterized Algorithms
- Tropical paths in vertex-colored graphs
- On cliques in graphs
This page was built for publication: Enumeration of minimal tropical connected sets
