Pages that link to "Item:Q1338961"
From MaRDI portal
The following pages link to Can visibility graphs be represented compactly? (Q1338961):
Displaying 21 items.
- Area requirement of visibility representations of trees (Q287042) (← links)
- On the kernel size of clique cover reductions for random intersection graphs (Q491163) (← links)
- Consensus algorithms for the generation of all maximal bicliques (Q705493) (← links)
- Alternating paths along axis-parallel segments (Q882782) (← links)
- An algorithm for the difference between set covers (Q944712) (← links)
- Arboricity and bipartite subgraph listing algorithms (Q1334644) (← links)
- Segment endpoint visibility graphs are Hamiltonian (Q1395575) (← links)
- Planar segment visibility graphs (Q1581056) (← links)
- New lower bounds for Hopcroft's problem (Q1816464) (← links)
- Topologically sweeping visibility complexes via pseudotriangulations (Q1816465) (← links)
- On counting point-hyperplane incidences (Q1873152) (← links)
- Large-scale clique cover of real-world networks (Q2288213) (← links)
- On computing the Galois lattice of bipartite distance hereditary graphs (Q2357768) (← links)
- Bi-objective optimization of biclustering with binary data (Q2666768) (← links)
- Random Latin square graphs (Q2909242) (← links)
- Clique Cover and Graph Separation (Q2943572) (← links)
- Known Algorithms for Edge Clique Cover are Probably Optimal (Q3464061) (← links)
- Perfect Graphs and Orthogonally Convex Covers (Q3828050) (← links)
- Representation Complexities of SemiAlgebraic Graphs (Q5237912) (← links)
- On the Chromatic Number of Random Cayley Graphs (Q5366943) (← links)
- Extractors in Paley graphs: a random model (Q5964262) (← links)
