1188 search results - page 114 / 238 » Extended Graph Unification |
98
Voted
FOCS
1996
IEEE
15 years 6 months ago
1996
IEEE
In thispaper we give a 3-approximationalgorithmfor the problem ojJnding a minimum tree spanning any k-vertices in a graph. Our algorithm extends to a 3-approximationalgorithmfor t...
106
click to vote
CONEXT
2008
ACM
15 years 4 months ago
2008
ACM
In this paper, we propose to extend the topology of Chord to a bidirectional graph to provide a super-peer based lookup algorithm and an efficient resource localization service at...
118
Voted
COCOA
2008
Springer
15 years 3 months ago
2008
Springer
We present efficient algorithms to generate all edge-magic and vertex-magic total labelings on cycles, and all vertex-magic total labelings on wheels. Using these algorithms, we ex...
107
Voted
DM
2006
15 years 2 months ago
2006
Berge's conjecture from 1982 on path partitions in directed graphs generalizes and extends Dilworth's Theorem and the Greene-Kleitman Theorem which are well known for pa...
133
Voted
CPC
2007
15 years 2 months ago
2007
Abstract. Szemer´edi’s regularity lemma for graphs has proved to be a powerful tool with many subsequent applications. The objective of this paper is to extend the techniques de...