5473 search results - page 246 / 1095 » On the graph isomorphism problem |
168
click to vote
FLAIRS
2006
15 years 8 months ago
2006
Decision support systems that capture, preserve, and reuse implicit knowledge can greatly benefit from explicitly using context. The development of this type of system can benefit...
195
click to vote
SDM
2004
SIAM
15 years 8 months ago
2004
SIAM
How does a `normal' computer (or social) network look like? How can we spot `abnormal' sub-networks in the Internet, or web graph? The answer to such questions is vital ...
208
click to vote
GD
2008
Springer
15 years 8 months ago
2008
Springer
A nonplanar graph G is near-planar if it contains an edge e such that G − e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from di...
205
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
We present a simple and efficient algorithm for randomly generating simple graphs without small cycles. These graphs can be used to design high performance Low-Density Parity-Chec...
182
click to vote
DAM
2008
15 years 7 months ago
2008
A vertex-cut X is said to be a restricted cut of a graph G if it is a vertex-cut such that no vertex u in G has all its neighbors in X. Clearly, each connected component of G - X ...