2283 search results - page 141 / 457 » Bounds of Graph Characteristics |
148
click to vote
ICALP
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We deal with two intimately related subjects: quasi-randomness and regular partitions. The purpose of the concept of quasi-randomness is to measure how much a given graph...
112
click to vote
COCOON
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. A circular-arc model (C, A) is a circle C together with a collection A of arcs of C. If A satisfies the Helly Property then (C, A) is a Helly circular-arc model. A (Helly...
130
Voted
PVLDB
2010
15 years 1 months ago
2010
Graph pattern matching is typically defined in terms of subgraph isomorphism, which makes it an np-complete problem. Moreover, it requires bijective functions, which are often to...
113
Voted
APWEB
2008
Springer
15 years 5 months ago
2008
Springer
The study of a national Web graph is challenging and can provide insight into social phenomena specific to a country. However, because there is no country border in the Web, decidi...
132
click to vote
COMBINATORICA
2008
15 years 3 months ago
2008
The rigidity of squares of graphs in three-space has important applications to the study of flexibility in molecules. The Molecular Conjecture, posed in 1984 by T-S. Tay and W. Wh...