5889 search results - page 210 / 1178 » Graph Layout Problems |
153
click to vote
FCT
2005
Springer
15 years 12 months ago
2005
Springer
Graph homomorphism, also called H-coloring, is a natural generalization of graph coloring: There is a homomorphism from a graph G to a complete graph on k vertices if and only if ...
170
click to vote
SSS
2009
Springer
16 years 1 months ago
2009
Springer
Graph searching games have been extensively studied in the past years. The graph searching problem involves a team of searchers who are attempting to capture a fugitive moving alon...
281
click to vote
VLDB
2012
ACM
14 years 2 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 ...
166
Voted
CEC
2005
IEEE
15 years 8 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...
174
click to vote
PODC
2006
ACM
16 years 12 days 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...