2314 search results - page 317 / 463 » Minimal Partitions of a Graph |
PPL
1998
15 years 3 months ago
1998
In this paper, we describe an ordering of the vertices of a 2-dimensional torus and study the upper bound on the orderly broadcast time. Along with messy broadcasting, orderly bro...
147
click to vote
SIGMOD
2004
ACM
16 years 4 months ago
2004
ACM
Increasing popularity of XML in recent years has generated much interest in query processing over graph-structured data. To support efficient evaluation of path expressions, many ...
148
Voted
IWDC
2005
Springer
15 years 9 months ago
2005
Springer
This paper deals with compact label-based representations for trees. Consider an n-node undirected connected graph G with a predefined numbering on the ports of each node. The al...
150
Voted
ICCV
2009
IEEE
16 years 9 months ago
2009
IEEE
Geometric rearrangement of images includes operations
such as image retargeting, inpainting, or object rearrangement.
Each such operation can be characterized by a shiftmap:
the...
135
Voted
STOC
2003
ACM
16 years 4 months ago
2003
ACM
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...