42 search results - page 6 / 9 » Combinatorial characterization of the Assur graphs from engi... |
COMBINATORICA
2008
13 years 7 months ago
2008
Consider the following seemingly rhetorical question: Is it crucial for a property-tester to know the error parameter in advance? Previous papers dealing with various testing prob...
VLDB
2005
ACM
14 years 1 months ago
2005
ACM
We present a new algorithm for finding large, dense subgraphs in massive graphs. Our algorithm is based on a recursive application of fingerprinting via shingles, and is extreme...
GD
2006
Springer
13 years 11 months ago
2006
Springer
The planarization method has proven to be successful in graph drawing. The output, a combinatorial planar embedding of the so-called planarized graph, can be combined with state-o...
TCOM
2010
13 years 2 months ago
2010
This paper presents a mathematical framework for the evaluation of the performance of proactive and reactive routing protocols in mobile ad hoc networks (MANETs). This unified fram...
DCG
2006
13 years 7 months ago
2006
Let A be a d by n matrix, d < n. Let C be the regular cross polytope (octahedron) in Rn . It has recently been shown that properties of the centrosymmetric polytope P = AC are ...