Pages that link to "Item:Q2019428"
From MaRDI portal
The following pages link to Fast constructive and improvement heuristics for edge clique covering (Q2019428):
Displaying 5 items.
- An overview of graph covering and partitioning (Q2142633) (← links)
- Finding optimal triangulations parameterized by edge clique cover (Q2161006) (← links)
- Large-scale clique cover of real-world networks (Q2288213) (← links)
- Known Algorithms for Edge Clique Cover are Probably Optimal (Q3464061) (← links)
- (Q6089669) (← links)