Pages that link to "Item:Q1748206"
From MaRDI portal
The following pages link to An improved upper bound and algorithm for clique covers (Q1748206):
Displaying 7 items.
- Constructing an indeterminate string from its associated graph (Q1698711) (← links)
- Clique Cover and Graph Separation (Q2943572) (← links)
- Clique Covering of Graphs IV. Algorithms (Q3340897) (← links)
- Known Algorithms for Edge Clique Cover are Probably Optimal (Q3464061) (← links)
- (Q4960830) (← links)
- Data reduction and exact algorithms for clique cover (Q5406188) (← links)
- Principles and Practice of Constraint Programming – CP 2004 (Q5900316) (← links)