Sciweavers

6740 search results - page 45 / 1348
» An s -Hamiltonian Line Graph Problem
Sort
View
STOC
2006
ACM
122views Algorithms» more  STOC 2006»
14 years 8 months ago
Hardness of cut problems in directed graphs
Julia Chuzhoy, Sanjeev Khanna
IPL
2007
121views more  IPL 2007»
13 years 7 months ago
Parameterized complexity of the induced subgraph problem in directed graphs
In this paper, we consider the parameterized complexity of the following problem: Given a hereditary property P on digraphs, an input digraph D and a positive integer k, does D ha...
Venkatesh Raman, Somnath Sikdar
ICML
2004
IEEE
14 years 8 months ago
Solving cluster ensemble problems by bipartite graph partitioning
A critical problem in cluster ensemble research is how to combine multiple clusterings to yield a final superior clustering result. Leveraging advanced graph partitioning techniqu...
Xiaoli Zhang Fern, Carla E. Brodley
ICCI
1991
13 years 11 months ago
On the k-Coloring of Intervals
The problem of coloring a set of n intervals (from the real line) with a set of k colors is studied. In such a coloring, two intersecting intervals must receive distinct colors. O...
Martin C. Carlisle, Errol L. Lloyd