On enumerating all minimal solutions of feedback problems
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- scientific article; zbMATH DE number 3573250 (Why is no real title available?)
- scientific article; zbMATH DE number 219267 (Why is no real title available?)
- scientific article; zbMATH DE number 3302923 (Why is no real title available?)
- A Graph Theoretic Approach to Statistical Data Security
- A Minimax Theorem for Directed Graphs
- A New Algorithm for Generating All the Maximal Independent Sets
- An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs
- Enumeration of all minimum feedback edge sets in a directed graph
- Feedback vertex sets and cyclically reducible graphs
- Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
- Generating the Acyclic Orientations of a Graph
- Hard Enumeration Problems in Geometry and Combinatorics
- On Minimum Cost Recovery from System Deadlock
- On generating all maximal independent sets
- The maximum clique problem
Cited in
(33)- An incremental polynomial time algorithm to enumerate all minimal edge dominating sets
- Generating 3-vertex connected spanning subgraphs
- On the minimum feedback vertex set problem: Exact and enumeration algorithms
- Open problems around exact algorithms
- Improved bounds for minimal feedback vertex sets in tournaments
- Polynomial delay algorithm for listing minimal edge dominating sets in graphs
- Proximity Search for Maximal Subgraph Enumeration
- Listing Maximal Subgraphs Satisfying Strongly Accessible Properties
- On enumerating minimal dicuts and strongly connected subgraphs
- Listing subgraphs by Cartesian decomposition
- Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
- Efficient constant-factor approximate enumeration of minimal subsets for monotone properties with weight constraints
- Feedback vertex sets in tournaments
- Fixed-parameter tractability results for feedback set problems in tournaments
- Generating cut conjunctions in graphs and related problems
- Exact computation of minimum feedback vertex sets with relational algebra
- Combinatorial algorithms for feedback problems in directed graphs
- Complexity of counting feedback vertex sets
- Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity
- Integer Programming and Combinatorial Optimization
- On locating minimum feedback vertex sets
- Efficient enumeration of graph orientations with sources
- Telling stories: enumerating maximal directed acyclic graphs with a constrained set of sources and targets
- scientific article; zbMATH DE number 7559431 (Why is no real title available?)
- Subset feedback vertex sets in chordal graphs
- On the complexity of solution extension of optimization problems
- Enumerating minimal subset feedback vertex sets
- Enumerating minimal dominating sets in chordal bipartite graphs
- Polynomial-delay and polynomial-space enumeration of large maximal matchings
- Enumeration of irredundant forests
- Unique key Horn functions
- Invited talks
- An exact method for the minimum feedback arc set problem
This page was built for publication: On enumerating all minimal solutions of feedback problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1348395)
