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

DOI10.1007/978-3-642-00202-1_23zbMath1211.05159MaRDI 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 graphs; threshold graphs; bipartite permutation graphs; conditional core path; core path

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

05C90: Applications of graph theory

90B80: Discrete location and assignment

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C85: Graph algorithms (graph-theoretic aspects)

Related Items

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