5606 search results - page 176 / 1122 » Randomization Techniques for Graphs. |
128
click to vote
ICIG
2009
IEEE
14 years 10 months ago
2009
IEEE
Optical flow estimation is one of the main subjects in computer vision. Many methods developed to compute the motion fields are built using standard heuristic formulation. In this...
98
Voted
KES
2008
Springer
15 years 19 days ago
2008
Springer
Bipartite graphs appear in various scenes in the real world, and visualizing these graphs helps improve our understanding of network structures. The amount of information that is a...
147
Voted
CORR
2010
Springer
14 years 11 months ago
2010
Springer
Graphs and graph transformation systems are a frequently used modelling technique for a wide range of different domains, covering areas as diverse as refactorings, network topolog...
94
Voted
CAAN
2004
Springer
15 years 6 months ago
2004
Springer
It appeared recently that the classical random graph model used to represent real-world complex networks does not capture their main properties. Since then, various attempts have ...
97
Voted
COMBINATORICA
2007
15 years 7 days ago
2007
A complete partition of a graph G is a partition of its vertex set in which any two distinct classes are connected by an edge. Let cp(G) denote the maximum number of classes in a ...