Core and Conditional Core Path of Specified Length in Special Classes of Graphs

DOI10.1007/978-3-642-00202-1_23zbMath1211.05159OpenAlexW2112895090MaRDI QIDQ3605503

No author found.

Publication date: 24 February 2009

Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00202-1_23

zbMATH Keywords

proper interval graphsthreshold graphsbipartite permutation graphsconditional core pathcore path

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Applications of graph theory (05C90) Discrete location and assignment (90B80) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Extensive facility location problems on networks: an updated review

Cites Work

• Unnamed Item
• Solving the shortest-paths problem on bipartite permutation graphs efficiently
• Bipartite permutation graphs
• Finding the \(\ell\)-core of a tree
• The location of median paths on grid graphs
• ON COMPUTING LONGEST PATHS IN SMALL GRAPH CLASSES
• On locating path- or tree-shaped facilities on networks
• On finding the core of a tree with a specified length
• The optimal location of a path or tree in a tree network
• A linear algorithm for a core of a tree
• Efficient Algorithms for Finding a Core of a Tree with a Specified Length
• Conditional location of path and tree shaped facilities on trees

This page was built for publication: Core and Conditional Core Path of Specified Length in Special Classes of Graphs