2487 search results - page 235 / 498 » Partitions of Graphs into Trees |
144
click to vote
GD
2004
Springer
15 years 9 months ago
2004
Springer
A k-stack layout (respectively, k-queue layout) of a graph consists of a total order of the vertices, and a partition of the edges into k sets of non-crossing (non-nested) edges wi...
138
click to vote
WWW
2004
ACM
16 years 4 months ago
2004
ACM
We present a framework for approximating random-walk based probability distributions over Web pages using graph aggregation. We (1) partition the Web's graph into classes of ...
161
click to vote
ICIP
2008
IEEE
15 years 10 months ago
2008
IEEE
Text segmentation, or named text binarization, is usually an essential step for text information extraction from images and videos. However, most existing text segmentation method...
135
click to vote
COCOON
2003
Springer
15 years 9 months ago
2003
Springer
We investigate hamiltonian properties of Pm × Cn, m ≥ 2 and even n ≥ 4, which is bipartite, in the presence of faulty vertices and/or edges. We show that Pm×Cn with n even is...
146
click to vote
ENDM
2010
15 years 4 months ago
2010
We consider a generalization of the Prize Collecting Steiner Tree Problem on a graph with special redundancy requirements on a subset of the customer nodes suitable to model a rea...