6740 search results - page 157 / 1348 » An s -Hamiltonian Line Graph Problem |
100
Voted
FAW
2009
Springer
15 years 7 months ago
2009
Springer
The pathwidth of a graph G is the minimum clique number of H minus one, over all interval supergraphs H of G. We prove in this paper that the PATHWIDTH problem is NP-hard for parti...
144
Voted
CIKM
2008
Springer
15 years 2 months ago
2008
Springer
Most prior work on information extraction has focused on extracting information from text in digital documents. However, often, the most important information being reported in an...
138
Voted
CAD
2005
Springer
15 years 21 days ago
2005
Springer
A tool which can quickly interpret line drawings (with hidden lines removed) of engineering objects as boundary representation CAD models would be of significant benefit in the pr...
77
Voted
SPAA
2009
ACM
16 years 1 months ago
2009
ACM
We consider the problem of time-constrained scheduling of packets in a communication network. Each packet has, in addition to its source and its destination, a release time and a ...
106
Voted
GREC
2003
Springer
15 years 6 months ago
2003
Springer
We aim to reconstruct three-dimensional polyhedral solids from axonometric-like line drawings. A new approach is proposed to make use of planes of mirror symmetry detected in such ...