Pages that link to "Item:Q3464061"
From MaRDI portal
The following pages link to Known Algorithms for Edge Clique Cover are Probably Optimal (Q3464061):
Displaying 21 items.
- On the kernel size of clique cover reductions for random intersection graphs (Q491163) (← links)
- On the complete width and edge clique cover problems (Q721937) (← links)
- Edge-clique covers of the tensor product (Q897963) (← links)
- Computational complexity of distance edge labeling (Q1647838) (← links)
- Complexity of Grundy coloring and its variants (Q1752449) (← links)
- On some FPT problems without polynomial Turing compressions (Q2072079) (← links)
- An overview of graph covering and partitioning (Q2142633) (← links)
- Finding optimal triangulations parameterized by edge clique cover (Q2161006) (← links)
- On the intractability landscape of digraph intersection representations (Q2169961) (← links)
- Parameterized analysis and crossing minimization problems (Q2172859) (← links)
- Large-scale clique cover of real-world networks (Q2288213) (← links)
- The graph motif problem parameterized by the structure of the input graph (Q2403795) (← links)
- Compressed cliques graphs, clique coverings and positive zero forcing (Q2636506) (← links)
- Known Algorithms for Edge Clique Cover are Probably Optimal (Q3464061) (← links)
- Positive Zero Forcing and Edge Clique Coverings (Q4632169) (← links)
- A Subexponential Parameterized Algorithm for Directed Subset Traveling Salesman Problem on Planar Graphs (Q5071089) (← links)
- Tight Lower Bounds for List Edge Coloring (Q5116492) (← links)
- (Q5136259) (← links)
- (Q5741783) (redirect page) (← links)
- (Q6068263) (← links)
- (Q6089669) (← links)
