557 search results - page 39 / 112 » Visualizing Weighted Edges in Graphs |
137
click to vote
OL
2011
14 years 6 months ago
2011
Given a simple undirected graph, the minimum connected dominating set problem is to find a minimum cardinality subset of vertices D inducing a connected subgraph such that each ve...
103
click to vote
SPAA
2005
ACM
15 years 4 months ago
2005
ACM
In 1995, Gremban, Miller, and Zagha introduced supporttree preconditioners and a parallel algorithm called supporttree conjugate gradient (STCG) for solving linear systems of the ...
WSR
2008
15 years 15 days ago
2008
: TGraphs are directed graphs with typed, attributed, and ordered nodes and edges. These properties leverage the use of graphs as models for all kinds of artifacts in the context o...
104
click to vote
DCG
2011
14 years 6 months ago
2011
We introduce an algorithm that embeds a given 3-connected planar graph as a convex 3-polytope with integer coordinates. The size of the coordinates is bounded by O(27.55n ) = O(18...
127
click to vote
CORR
2007
Springer
14 years 11 months ago
2007
Springer
—We consider point to point link scheduling in Spatial Time Division Multiple Access (STDMA) wireless networks under the physical interference model. We propose a novel link sche...