Enumerating minimal solution sets for metric graph problems

Cites work

A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs
A New Algorithm for Generating All the Maximal Independent Sets
A polynomial delay algorithm for enumerating minimal dominating sets in chordal graphs
Algorithms for dualization over products of partially ordered sets
Complexity of metric dimension on planar graphs
Computational aspects of monotone dualization: a brief survey
Computing minimum geodetic sets of proper interval graphs
COMs: complexes of oriented matroids
Discovery of the D-basis in binary tables based on hypergraph dualization
Domination and location in acyclic graphs
Dualization in lattices given by implicational bases
Enumerating minimal connected dominating sets
Enumerating minimal dominating sets in \(K_t\)-free graphs and variants
Enumerating minimal transversals of hypergraphs without small holes
Enumeration complexity
Geometric amortization of enumeration algorithms
scientific article; zbMATH DE number 3494441 (Why is no real title available?)
scientific article; zbMATH DE number 3544092 (Why is no real title available?)
scientific article; zbMATH DE number 3639144 (Why is no real title available?)
scientific article; zbMATH DE number 7765365 (Why is no real title available?)
Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity
Identifying the Minimal Transversals of a Hypergraph and Related Problems
Known algorithms for edge clique cover are probably optimal
Lattice theory.
Linear delay enumeration and monadic second-order logic
Listing induced Steiner subgraphs as a compact way to discover Steiner trees in graphs
Low-dimensional representation of genomic sequences
Maximal irredundant set enumeration in bounded-degeneracy and bounded-degree hypergraphs
New Results on Monotone Dualization and Generating Hypergraph Transversals
On a new class of codes for identifying vertices in graphs
On Dualization over Distributive Lattices
On generating all maximal independent sets
On Metric Generators of Graphs
On the Complexity of Dualization of Monotone Disjunctive Normal Forms
On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs
On the enumeration of minimal dominating sets and related notions
On the parameterized complexity of biclique cover and partition
Output-polynomial enumeration on graphs of bounded (local) linear MIM-width
Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs
Polynomial time algorithms for computing a minimum hull set in distance-hereditary and chordal graphs
Sequential metric dimension
Structure-activity maps for visualizing the graph variables arising in drug design
The (weighted) metric dimension of graphs: hard and easy cases
The geodetic number of a graph
The joy of implications, aka pure Horn formulas: mainly a survey
The strong metric dimension of graphs and digraphs
The virtual Haken conjecture (with an appendix by Ian Agol, Daniel Groves and Jason Manning).
Translating between the representations of a ranked convex geometry
Well-partitioned chordal graphs

Cited in

(5)

Problems in NP can admit double-exponential lower bounds when parameterized by treewidth or vertex cover
Enumerating minimal solution sets for metric graph problems
Metric dimension and geodetic set parameterized by vertex cover
Algorithms and hardness for geodetic set on tree-like digraphs
Geodetic set on graphs of constant pathwidth and feedback vertex set number

This page was built for publication: Enumerating minimal solution sets for metric graph problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6988729)