Enumeration of minimal tropical connected sets
From MaRDI portal
Cites work
- A note on the complexity of the chromatic number problem
- Algorithmic graph theory and perfect graphs
- Capacitated domination faster than O(2ⁿ)
- Combinatorial bounds via measure and conquer
- Computing tree-depth faster than \(2^n\)
- Connected tropical subgraphs in vertex-colored graphs
- Connecting Terminals and 2-Disjoint Connected Subgraphs
- Enumerating Minimal Tropical Connected Sets
- Enumeration and maximum number of minimal dominating sets for chordal graphs
- Enumeration of minimal connected dominating sets for chordal graphs
- Exact exponential algorithms to find a tropical connected set of minimum size
- Exact exponential algorithms to find tropical connected sets of minimum size
- Exact exponential algorithms.
- Graph Classes: A Survey
- Hardness of Easy Problems: Basing Hardness on Popular Conjectures such as the Strong Exponential Time Hypothesis (Invited Talk)
- Improved Exact Algorithms for Counting 3- and 4-Colorings
- Irredundant Set Faster Than O(2 n )
- Largest chordal and interval subgraphs faster than \(2^n\)
- Minimal triangulations of graphs: a survey
- On cliques in graphs
- On the number of minimal dominating sets on some graph classes
- Parameterized algorithms
- Path contraction faster than 2ⁿ
- Solving connected dominating set faster than \(2^n\)
- Solving target set selection with bounded thresholds faster than \(2^n\)
- Solving the 2-disjoint connected subgraphs problem faster than \(2^n\)
- Trees having many minimal dominating sets
- Tropical matchings in vertex-colored graphs
- Tropical paths in vertex-colored graphs
- Tropical vertex-disjoint cycles of a vertex-colored digraph: barter exchange with multiple items per agent
This page was built for publication: Enumeration of minimal tropical connected sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6057321)
