736 search results - page 1 / 148 » Distinguishing geometric graphs |
JGT
2006
13 years 5 months ago
2006
We begin the study of distinguishing geometric graphs. Let G be a geometric graph. An automorphism of the underlying graph that preserves both crossings and noncrossings is called...
ICDE
2006
IEEE
14 years 6 months ago
2006
IEEE
Efficient indexing techniques have been developed for the exact and approximate substructure search in large scale graph databases. Unfortunately, the retrieval problem of structu...
GD
2009
Springer
13 years 8 months ago
2009
Springer
We describe an algorithm for radial layout of undirected graphs, in which nodes are constrained to concentric circles centered at the origin. Such constraints are typical, e.g., i...
ICMI
2007
Springer
13 years 11 months ago
2007
Springer
Automatic distinction between posed and spontaneous expressions is an unsolved problem. Previously cognitive sciences’ studies indicated that the automatic separation of posed f...
DCG
2008
13 years 5 months ago
2008