3757 search results - page 324 / 752 » The overlap number of a graph |
183
click to vote
JGAA
2000
15 years 6 months ago
2000
Current orthogonal graph drawing algorithms produce drawings which are generally good. However, many times the quality of orthogonal drawings can be significantly improved with a ...
202
click to vote
ALGORITHMICA
1998
15 years 6 months ago
1998
In this paper we give a fully dynamic approximation scheme for maintaining all-pairs shortest paths in planar networks. Given an error parameter ε such that 0 < ε, our algorit...
192
click to vote
MLQ
1998
15 years 6 months ago
1998
We examine a number of results of infinite combinatorics using the techniques of reverse mathematics. Our results are inspired by similar results in recursive combinatorics. Theor...
160
click to vote
TIT
1998
15 years 6 months ago
1998
—We investigate a new class of codes for the optimal covering of vertices in an undirected graph Gsuch that any vertex in G can be uniquely identified by examining the vertices ...
174
click to vote
SADM
2008
15 years 6 months ago
2008
: In this paper, we introduce the concept of -orthogonal patterns to mine a representative set of graph patterns. Intuitively, two graph patterns are -orthogonal if their similarit...