6740 search results - page 161 / 1348 » An s -Hamiltonian Line Graph Problem |
STOC
1995
ACM
15 years 4 months ago
1995
ACM
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...
104
click to vote
EOR
2007
15 years 21 days ago
2007
This paper presents an investigation of a simple generic hyper-heuristic approach upon a set of widely used constructive heuristics (graph coloring heuristics) in timetabling. Wit...
110
Voted
CVPR
2011
IEEE
14 years 8 months ago
2011
IEEE
The problem of finding one-dimensional structures in images and videos can be formulated as a problem of searching for cycles in graphs. In [11], an untangling-cycle cost functio...
102
Voted
ESANN
2008
15 years 2 months ago
2008
Abstract. This paper introduces a new concept to the processing of graph structured information using self organising map framework. Previous approaches to this problem were limite...
111
click to vote
SIAMDM
2010
14 years 7 months ago
2010
We consider the problem of finding obnoxious centers in graphs. For arbitrary graphs with n vertices and m edges, we give a randomized algorithm with O(n log2 n + m log n) expecte...