6740 search results - page 256 / 1348 » An s -Hamiltonian Line Graph Problem |
106
Voted
CVPR
2006
IEEE
16 years 2 months ago
2006
IEEE
This paper addresses the problem of reconstructing the density of a scene from multiple projection images produced by modalities such as x-ray, electron microscopy, etc. where an ...
104
Voted
AICCSA
2005
IEEE
15 years 6 months ago
2005
IEEE
In this paper we present three algorithms that build graph layouts for undirected, weighted graphs. Our goal is to generate layouts that are consistent with the weights in the gra...
192
click to vote
VLDB
2012
ACM
13 years 8 months ago
2012
ACM
The growing popularity of graph databases has generated interesting data management problems, such as subgraph search, shortest path query, reachability verification, and pattern ...
106
Voted
CEC
2005
IEEE
15 years 2 months ago
2005
IEEE
The dynamics of neural and other automata networks are defined to a large extent by their topologies. Artificial evolution constitutes a practical means by which an optimal topolog...
108
Voted
PODC
2006
ACM
15 years 6 months ago
2006
ACM
We study a novel separator property called k-path separable. Roughly speaking, a k-path separable graph can be recursively separated into smaller components by sequentially removi...