Pages that link to "Item:Q1348395"
From MaRDI portal
The following pages link to On enumerating all minimal solutions of feedback problems (Q1348395):
Displaying 24 items.
- Enumerating minimal subset feedback vertex sets (Q472481) (← links)
- An incremental polynomial time algorithm to enumerate all minimal edge dominating sets (Q494806) (← links)
- Telling stories: enumerating maximal directed acyclic graphs with a constrained set of sources and targets (Q714835) (← links)
- Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization (Q856420) (← links)
- Enumerating minimal dominating sets in chordal bipartite graphs (Q896653) (← links)
- Generating cut conjunctions in graphs and related problems (Q930604) (← links)
- On the minimum feedback vertex set problem: Exact and enumeration algorithms (Q958216) (← links)
- Generating 3-vertex connected spanning subgraphs (Q998366) (← links)
- Combinatorial algorithms for feedback problems in directed graphs (Q1007586) (← links)
- Efficient enumeration of graph orientations with sources (Q1647832) (← links)
- Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity (Q1680547) (← links)
- On the complexity of solution extension of optimization problems (Q2072063) (← links)
- Fixed-parameter tractability results for feedback set problems in tournaments (Q2266940) (← links)
- Subset feedback vertex sets in chordal graphs (Q2447531) (← links)
- On enumerating minimal dicuts and strongly connected subgraphs (Q2471808) (← links)
- Open problems around exact algorithms (Q2473037) (← links)
- Unique key Horn functions (Q2672584) (← links)
- Enumeration of irredundant forests (Q2672596) (← links)
- Invited talks (Q2692717) (← links)
- Improved bounds for minimal feedback vertex sets in tournaments (Q4581278) (← links)
- Feedback Vertex Sets in Tournaments (Q4908824) (← links)
- (Q5005188) (← links)
- (Q5089231) (← links)
- (Q5095623) (← links)
