- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
1 Online-Ressource.
- Language
-
Englisch
- Bibliographic citation
-
Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs ; volume:85 ; number:9 ; day:11 ; month:3 ; year:2023 ; pages:2580-2604 ; date:9.2023
Algorithmica ; 85, Heft 9 (11.3.2023), 2580-2604, 9.2023
- Creator
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s00453-023-01109-z
- URN
-
urn:nbn:de:101:1-2023121212295945009688
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:29 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Martin, Barnaby
- Paulusma, Daniel
- Smith, Siani
- Leeuwen, Erik Jan van
- SpringerLink (Online service)
Other Objects (12)
Shortest edge disjoint paths in graphs
Finding Disjoint Paths on Directed Acyclic Graphs
Computing vertex-disjoint paths in large graphs using MAOs
Fastest Paths, Almost Disjoint Paths, and Beyond
Edge-Disjoint Paths in Planar Graphs with Short Total Length
Edge-Disjoint Paths in Eulerian Digraphs
The Complexity of Packing Edge-Disjoint Paths
Disjoint Paths, Dynamic Equilibria, and the Design of Networks
Improved Algorithms for the 2-Vertex Disjoint Paths Problem
On Structural Parameterizations of the Edge Disjoint Paths Problem
Combinatorial optimization, Vol. C.. Disjoint paths, hypergraphs : chapters 70 - 83
New algorithms for maximum disjoint paths based on tree-likeness
Shortest edge disjoint paths in graphs
Finding Disjoint Paths on Directed Acyclic Graphs
Computing vertex-disjoint paths in large graphs using MAOs
Fastest Paths, Almost Disjoint Paths, and Beyond
Edge-Disjoint Paths in Planar Graphs with Short Total Length
Edge-Disjoint Paths in Eulerian Digraphs
The Complexity of Packing Edge-Disjoint Paths
Disjoint Paths, Dynamic Equilibria, and the Design of Networks
Improved Algorithms for the 2-Vertex Disjoint Paths Problem
On Structural Parameterizations of the Edge Disjoint Paths Problem
Combinatorial optimization, Vol. C.. Disjoint paths, hypergraphs : chapters 70 - 83
New algorithms for maximum disjoint paths based on tree-likeness
Shortest edge disjoint paths in graphs
Finding Disjoint Paths on Directed Acyclic Graphs
Computing vertex-disjoint paths in large graphs using MAOs
Fastest Paths, Almost Disjoint Paths, and Beyond
Edge-Disjoint Paths in Planar Graphs with Short Total Length
Edge-Disjoint Paths in Eulerian Digraphs
The Complexity of Packing Edge-Disjoint Paths
Disjoint Paths, Dynamic Equilibria, and the Design of Networks
Improved Algorithms for the 2-Vertex Disjoint Paths Problem
On Structural Parameterizations of the Edge Disjoint Paths Problem
Combinatorial optimization, Vol. C.. Disjoint paths, hypergraphs : chapters 70 - 83