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

Authors:
S. Balasubramanian;S. Harini;C. Pandu Rangan
Affiliations:
Department of Computer Science and Engineering, IIT Madras, India 600036;Department of Computer Science and Engineering, IIT Madras, India 600036;Department of Computer Science and Engineering, IIT Madras, India 600036
Venue:
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Year:
2009

Citing 7
Cited 0

Solving the shortest-paths problem on bipartite permutation graphs efficiently

Information Processing Letters
Efficient algorithms for finding a core of a tree with a specified length

Journal of Algorithms
Finding the ℓ-core of a tree

Discrete Applied Mathematics - Special issue: Third ALIO-EURO meeting on applied combinatorial optimization
Finding Cores of Limited Length

WADS '97 Proceedings of the 5th International Workshop on Algorithms and Data Structures
The Conditional Location of a Median Path

COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Bipartite permutation graphs

Discrete Applied Mathematics
Conditional location of path and tree shaped facilities on trees

Journal of Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

A core path of a graph is a path P in G that minimizes d (P ) = ${\underset{v \in V}{\sum}} d(v,P)w(v)$. In this paper, we study the location of core path of specified length in special classes of graphs. Further, we extend our study to the problem of locating a core path of specified length under the condition that some existing facilities are already located (known as conditional core path of a graph). We study both the problems stated above in vertex weighted bipartite permutation graphs, threshold graphs and proper interval graphs and give polynomial time algorithms for the core path and conditional core path problem in these classes. We also establish the NP-Completeness of the above problems in the same classes of graphs when arbitrary positive weights are assigned to edges.