A note on the complexity of longest path problems related to graph coloring
نویسندگان
چکیده
In this note, we show that some problems related to the length of the longest simple path from a given vertex in a graph are NP-complete. We also discuss an extension to the graph coloring problem. @ 2004 Elsevier Ltd. All rights reserved. Keywords-Longest path, Graph coloring, Complexity.
منابع مشابه
Longest Path in Networks of Queues in the Steady-State
Due to the importance of longest path analysis in networks of queues, we develop an analytical method for computing the steady-state distribution function of longest path in acyclic networks of queues. We assume the network consists of a number of queuing systems and each one has either one or infinite servers. The distribution function of service time is assumed to be exponential or Erlang. Fu...
متن کاملComputing and Counting the Longest Paths on Circular-Arc Graphs in Polynomial Time
The longest path problem asks for a path with the largest number of vertices in a given graph. In contrast to the Hamiltonian path problem, until recently polynomial algorithms for the longest path problem were known only for small graph classes, such as trees. Recently, a polynomial algorithm for this problem on interval graphs has been presented in [20] with running time O(n) on a graph with ...
متن کاملWhat Structural Features Make Graph Problems to Have Efficient Parallel Algorithms? —Using Outerplanar Graphs, Trapezoid Graphs and In-Tournament Graphs as Examples—
This paper analyzes what structural features of graph problems allow efficient parallel algorithms. We survey some parallel algorithms for typical problems on three kinds of graphs, outerplanar graphs, trapezoid graphs and in-tournament graphs. Our results on the shortest path problem, the longest path problem and the maximum flow problem on outerplanar graphs, the minimum-weight connected domi...
متن کاملComputing and Counting Longest Paths on Circular-Arc Graphs in Polynomial Time
The longest path problem asks for a path with the largest number of vertices in a given graph. In contrast to the Hamiltonian path problem, until recently polynomial algorithms for the longest path problem were known only for small graph classes, such as trees. Recently, a polynomial algorithm for this problem on interval graphs has been presented in Ioannidou et al. (2011) [19] with running ti...
متن کاملApplications of Parameterized st-Orientations
An st-orientation of a biconnected undirected graph defines a directed graph with no cycles, a single source s and a single sink t. Given an undirected graph G as input, linear-time algorithms have been proposed for computing an st-orientation of G. Such an orientation is useful especially in graph drawing algorithms which use it at their first stage [23]. Namely, before they process the origin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Appl. Math. Lett.
دوره 17 شماره
صفحات -
تاریخ انتشار 2004