3757 search results - page 168 / 752 » The overlap number of a graph |
158
click to vote
SAC
2005
ACM
15 years 12 months ago
2005
ACM
We present a strategy for analyzing large, social small-world graphs, such as those formed by human networks. Our approach brings together ideas from a number of different resear...
174
click to vote
GD
2009
Springer
15 years 11 months ago
2009
Springer
The geometric simultaneous embedding problem asks whether two planar graphs on the same set of vertices in the plane can be drawn using straight lines, such that each graph is pla...
166
click to vote
EUROPAR
1999
Springer
15 years 10 months ago
1999
Springer
Recently, a number of graph partitioning applications have emerged with additional requirements that the traditional graph partitioning model alone cannot e ectively handle. One s...
175
click to vote
ECCC
2008
15 years 6 months ago
2008
Testing a property P of graphs in the bounded degree model is the following computational problem: given a graph G of bounded degree d we should distinguish (with probability 0.9,...
171
click to vote
PVLDB
2010
15 years 4 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...