2283 search results - page 81 / 457 » Bounds of Graph Characteristics |
163
Voted
DIALM
2008
ACM
15 years 5 months ago
2008
ACM
A random geometric graph G(n, r) is a graph resulting from placing n points uniformly at random on the unit area disk, and connecting two points iff their Euclidean distance is at ...
127
Voted
DAM
2007
15 years 3 months ago
2007
We study the following problem: Given a tree G and a finite set of trees H, find a subset O of the edges of G such that G − O does not contain a subtree isomorphic to a tree f...
142
Voted
WG
2001
Springer
15 years 8 months ago
2001
Springer
In a graph coloring, each color class induces a disjoint union of isolated vertices. A graph subcoloring generalizes this concept, since here each color class induces a disjoint un...
155
Voted
INFOCOM
2011
IEEE
14 years 7 months ago
2011
IEEE
—An approximate distance query data structure is a compact representation of a graph, and can be queried to approximate shortest paths between any pair of vertices. Any such data...
148
click to vote
IPPS
1998
IEEE
15 years 8 months ago
1998
IEEE
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...