3268 search results - page 307 / 654 » The hub number of a graph |
184
click to vote
LPAR
2004
Springer
16 years 3 days ago
2004
Springer
We propose a new parameter for the complexity of finite directed graphs which measures to what extent the cycles of the graph are intertwined. This measure, called entanglement, i...
148
click to vote
STOC
2010
ACM
15 years 11 months ago
2010
ACM
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
171
click to vote
IH
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. One way to protect a digital product is to embed an author's signature into the object in the form of minute errors. However, this technique cannot be directly appli...
202
click to vote
WADS
1993
Springer
15 years 10 months ago
1993
Springer
The Minimum Weight Euclidean Matching (MWEM) problem is: given 2n point sites in the plane with Euclidean metric for interpoint distances, match the sites into n pairs so that the...
155
click to vote
EMMCVPR
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. In this paper, we present an automatic human portrait system based on the And-Or graph representation. The system can automatically generate a set of life-like portraits ...