Pages that link to "Item:Q1283681"
From MaRDI portal
The following pages link to Output-sensitive reporting of disjoint paths (Q1283681):
Displaying 28 items.
- Lower and upper bounds for long induced paths in 3-connected planar graphs (Q290522) (← links)
- Independent spanning trees of chordal rings (Q294645) (← links)
- A simple routing algorithm based on Schnyder coordinates (Q391094) (← links)
- On succinct greedy drawings of plane triangulations and 3-connected plane graphs (Q476437) (← links)
- Monotone drawings of graphs with few directions (Q506161) (← links)
- On simultaneous straight-line grid embedding of a planar graph and its dual (Q845659) (← links)
- Orthogonal surfaces and their CP-orders (Q925257) (← links)
- Simple computation of \textit{st}-edge- and \textit{st}-numberings from ear decompositions (Q1730030) (← links)
- Reconstructing edge-disjoint paths faster (Q1785736) (← links)
- Incremental convex planarity testing (Q1854448) (← links)
- Linear time algorithms for two disjoint paths problems on directed acyclic graphs (Q1929240) (← links)
- Convex grid drawings of planar graphs with constant edge-vertex resolution (Q2169950) (← links)
- Drawing planar graphs with few segments on a polynomial grid (Q2206874) (← links)
- Minimum-segment convex drawings of 3-connected cubic plane graphs (Q2377378) (← links)
- A bijection between realizers of maximal plane graphs and pairs of non-crossing Dyck paths (Q2566278) (← links)
- Mondshein sequences (a.k.a. (2,1)-orders) (Q2832896) (← links)
- Multi-interval Pairwise Compatibility Graphs (Q2988811) (← links)
- Monotone Drawings of 3-Connected Plane Graphs (Q3452836) (← links)
- On Representation of Planar Graphs by Segments (Q3511438) (← links)
- (Q4703869) (← links)
- Straight-line monotone grid drawings of series–parallel graphs (Q5261041) (← links)
- CONSTRAINED DISJOINT PATHS IN GEOMETRIC NETWORKS (Q5325617) (← links)
- Strictly-convex drawings of 3-connected planar graphs (Q6117042) (← links)
- Convex grid drawings of planar graphs with constant edge-vertex resolution (Q6199406) (← links)
- Efficient enumeration of drawings and combinatorial structures for maximal planar graphs (Q6575407) (← links)
- \((t, s)\)-completely independent spanning trees (Q6575408) (← links)
- A Schnyder-type drawing algorithm for 5-connected triangulations (Q6618254) (← links)
- Structural parameters of Schnyder woods (Q6646404) (← links)
