6740 search results - page 326 / 1348 » An s -Hamiltonian Line Graph Problem |
127
Voted
DAGSTUHL
2007
15 years 5 months ago
2007
One of the standard basic steps in drawing hierarchical graphs is to invert some arcs of the given graph to make the graph acyclic. We discuss exact and parameterized algorithms fo...
118
click to vote
NIPS
2008
15 years 5 months ago
2008
We continue our study of online prediction of the labelling of a graph. We show a fundamental limitation of Laplacian-based algorithms: if the graph has a large diameter then the ...
122
click to vote
FLAIRS
2006
15 years 5 months ago
2006
Decision support systems that capture, preserve, and reuse implicit knowledge can greatly benefit from explicitly using context. The development of this type of system can benefit...
139
click to vote
SDM
2004
SIAM
15 years 5 months ago
2004
SIAM
How does a `normal' computer (or social) network look like? How can we spot `abnormal' sub-networks in the Internet, or web graph? The answer to such questions is vital ...
151
click to vote
GD
2008
Springer
15 years 5 months ago
2008
Springer
A nonplanar graph G is near-planar if it contains an edge e such that G − e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from di...