1321 search results - page 43 / 265 » Quadratic forms on graphs |
DM
2010
13 years 10 months ago
2010
A graph G is loosely-c-connected, or -c-connected, if there exists a number d depending on G such that the deletion of fewer than c vertices from G leaves precisely one infinite co...
JCT
2007
13 years 9 months ago
2007
The preferential attachment graph Gm(n) is a random graph formed by adding a new vertex at each time step, with m edges which point to vertices selected at random with probability...
IPL
2010
13 years 8 months ago
2010
We show that any face hitting set of size n of a connected planar graph with a minimum degree of at least 3 is contained in a connected subgraph of size 5n − 6. Furthermore we s...
PVLDB
2008
13 years 8 months ago
2008
Keyword search on graph structured data has attracted a lot of attention in recent years. Graphs are a natural "lowest common denominator" representation which can combi...
DGCI
2003
Springer
14 years 3 months ago
2003
Springer
This paper describes a method to accelerate the generation of shape primitives for N-dimensional images N X . These shape primitives can be used in conditions for topology preservi...