5473 search results - page 187 / 1095 » On the graph isomorphism problem |
187
click to vote
AICCSA
2005
IEEE
16 years 23 days 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...
297
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 ...
190
click to vote
CEC
2005
IEEE
15 years 9 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...
207
click to vote
PODC
2006
ACM
16 years 1 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...
197
click to vote
MP
2006
15 years 7 months ago
2006
Graphs with circular symmetry, called webs, are relevant w.r.t. describing the stable set polytopes of two larger graph classes, quasi-line graphs [8,12] and claw-free graphs [7,8]...