5473 search results - page 120 / 1095 » On the graph isomorphism problem |
152
click to vote
WEA
2004
Springer
15 years 11 months ago
2004
Springer
A homogeneous set is a non-trivial, proper subset of a graph’s vertices such that all its elements present exactly the same outer neighborhood. Given two graphs, G1(V, E1), G2(V,...
165
click to vote
DAM
2007
15 years 6 months ago
2007
In hardware design, it is necessary to simulate the anticipated behavior of the integrated circuit before it is actually cast in silicon. As simulation procedures are long due to ...
155
click to vote
STACS
2001
Springer
15 years 10 months ago
2001
Springer
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...
178
click to vote
GD
2004
Springer
15 years 11 months ago
2004
Springer
Large graphs are difficult to browse and to visually explore. This note adds up evidence that some graph drawing techniques, which produce readable layouts when applied to medium-s...
186
click to vote
TCS
2011
15 years 1 months ago
2011
The problem of computing minimum distortion embeddings of a given graph into a line (path) was introduced in 2004 and has quickly attracted significant attention with subsequent ...