Exact exponential algorithms to find a tropical connected set of minimum size
From MaRDI portal
Publication:2946015
Recommendations
Cites work
- An exact algorithm for connected red-blue dominating set
- Complexity issues in vertex-colored graph pattern matching
- Connected tropical subgraphs in vertex-colored graphs
- Exact exponential algorithms.
- Fast polynomial-space algorithms using inclusion-exclusion. Improving on Steiner tree and related problems
- Finding and counting vertex-colored subtrees
- Graph-Theoretic Concepts in Computer Science
- On the Kernelization Complexity of Colorful Motifs
- On the complexity of \(k\)-SAT
- STACS 2004
- Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Triangulating Vertex-Colored Graphs
- Upper and lower bounds for finding connected motifs in vertex-colored graphs
Cited in
(3)
This page was built for publication: Exact exponential algorithms to find a tropical connected set of minimum size
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2946015)