Pages that link to "Item:Q1920221"
From MaRDI portal
The following pages link to Reduced constants for simple cycle graph separation (Q1920221):
Displaying 17 items.
- Theory and application of width bounded geometric separators (Q632801) (← links)
- How to catch marathon cheaters: new approximation algorithms for tracking paths (Q832889) (← links)
- On cleaving a planar graph (Q917567) (← links)
- Sublinear time width-bounded separators and their application to the protein side-chain packing problem (Q927195) (← links)
- Anticoloring of a family of grid graphs (Q937411) (← links)
- Anticoloring and separation of graphs (Q960942) (← links)
- On classes of graphs with strongly sublinear separators (Q1750205) (← links)
- Graph separators: A parameterized view (Q1877710) (← links)
- Tabu search for the BWC problem (Q1928269) (← links)
- Counting triangulations and other crossing-free structures approximately (Q2341692) (← links)
- MULTI-DIRECTIONAL WIDTH-BOUNDED GEOMETRIC SEPARATOR AND PROTEIN FOLDING (Q3607489) (← links)
- Short and Simple Cycle Separators in Planar Graphs (Q5266605) (← links)
- Drawing Planar Graphs with Reduced Height (Q5892364) (← links)
- Maximum matchings in geometric intersection graphs (Q6050213) (← links)
- Clique-based separators for geometric intersection graphs (Q6103521) (← links)
- Counting cycles on planar graphs in subexponential time (Q6182684) (← links)
- On the oriented diameter of planar triangulations (Q6645167) (← links)