Vertex Disjoint Paths for Dispatching in Railways.
From MaRDI portal
Publication:2917287
DOI10.4230/OASIcs.ATMOS.2010.61zbMath1247.90044OpenAlexW2122160710MaRDI QIDQ2917287
Holger Flier, Matúš Mihalák, Anita Schöbel, Anna Zych, Peter Widmayer
Publication date: 28 September 2012
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2010/2750/pdf/6.pdf/
Programming involving graphs or networks (90C35) Applications of graph theory (05C90) Transportation, logistics and supply chain management (90B06) Paths and cycles (05C38) Discrete location and assignment (90B80)
Related Items (8)
Scheduling trains with small stretch on a unidirectional line ⋮ Weighted independent sets in classes of \(P_6\)-free graphs ⋮ Maximum weight independent sets in classes related to claw-free graphs ⋮ On atomic structure of \(P_5\)-free subclasses and maximum weight independent set problem ⋮ Weighted independent sets in a subclass of \(P_6\)-free graphs ⋮ An algorithm for the maximum weight independent set problem on outerstring graphs ⋮ Maximum Independent Set in 2-Direction Outersegment Graphs ⋮ Train Scheduling on a Unidirectional Path
This page was built for publication: Vertex Disjoint Paths for Dispatching in Railways.
