Pages that link to "Item:Q494806"
From MaRDI portal
The following pages link to An incremental polynomial time algorithm to enumerate all minimal edge dominating sets (Q494806):
Displaying 15 items.
- Enumeration of maximal irredundant sets for claw-free graphs (Q1628586) (← links)
- Output-polynomial enumeration on graphs of bounded (local) linear MIM-width (Q1709594) (← links)
- Efficient enumeration of dominating sets for sparse graphs (Q1983139) (← links)
- On the dualization in distributive lattices and related problems (Q2030249) (← links)
- Algorithmic aspects of upper edge domination (Q2034795) (← links)
- On the complexity of solution extension of optimization problems (Q2072063) (← links)
- Invited talks (Q2692717) (← links)
- Enumerating Minimal Transversals of Hypergraphs without Small Holes (Q5005157) (← links)
- EDGE DOMINATION NUMBER AND THE NUMBER OF MINIMUM EDGE DOMINATING SETS IN PSEUDOFRACTAL SCALE-FREE WEB AND SIERPIŃSKI GASKET (Q5025346) (← links)
- Proximity Search for Maximal Subgraph Enumeration (Q5048293) (← links)
- Enumerating Minimal Dominating Sets in Triangle-Free Graphs (Q5090462) (← links)
- (Q5090486) (← links)
- (Q5090998) (← links)
- Enumeration of Maximal Irredundant Sets for Claw-Free Graphs (Q5283376) (← links)
- Extension of some edge graph problems: standard, parameterized and approximation complexity (Q6048430) (← links)
