Pages that link to "Item:Q5954246"
From MaRDI portal
The following pages link to The edge-disjoint paths problem is NP-complete for series-parallel graphs (Q5954246):
Displaying 28 items.
- Edge-disjoint odd cycles in 4-edge-connected graphs (Q273163) (← links)
- The minimum vulnerability problem on specific graph classes (Q346526) (← links)
- Finding disjoint paths in split graphs (Q493652) (← links)
- The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs (Q520046) (← links)
- Multiflows in symmetric digraphs (Q713317) (← links)
- Disjoint paths in sparse graphs (Q967419) (← links)
- Disjoint paths in symmetric digraphs (Q1003758) (← links)
- Complexity results for minimum sum edge coloring (Q1028432) (← links)
- On maximum common subgraph problems in series-parallel graphs (Q1678090) (← links)
- A linear time algorithm for a variant of the MAX CUT problem in series parallel graphs (Q1748508) (← links)
- List total colorings of series-parallel graphs (Q1775015) (← links)
- New algorithms for maximum disjoint paths based on tree-likeness (Q1785205) (← links)
- Call control with \(k\) rejections (Q1877703) (← links)
- On structural parameterizations of the edge disjoint paths problem (Q2032342) (← links)
- Max-multiflow/min-multicut for G+H series-parallel (Q2275455) (← links)
- Terminal-pairability in complete bipartite graphs with non-bipartite demands. Edge-disjoint paths in complete bipartite graphs (Q2419108) (← links)
- Line graphs of bounded clique-width (Q2461201) (← links)
- Finding edge-disjoint paths in networks: an ant colony optimization algorithm (Q2466394) (← links)
- Vertex disjoint paths on clique-width bounded graphs (Q2503296) (← links)
- The power of cut-based parameters for computing edge-disjoint paths (Q2659778) (← links)
- As Time Goes By: Reflections on Treewidth for Temporal Graphs (Q5042450) (← links)
- A tight relation between series-parallel graphs and bipartite distance hereditary graphs (Q5045248) (← links)
- (Q5136255) (← links)
- Walking through waypoints (Q5918830) (← links)
- The disjoint path cover in the data center network HSDC with prescribed vertices in each path (Q6048642) (← links)
- Solving the edge‐disjoint paths problem using a two‐stage method (Q6066718) (← links)
- Edge-treewidth: algorithmic and combinatorial properties (Q6069149) (← links)
- On undirected two‐commodity integral flow, disjoint paths and strict terminal connection problems (Q6087136) (← links)
