1749 search results - page 289 / 350 » Conditional colorings of graphs |
167
click to vote
IPPS
2002
IEEE
15 years 11 months ago
2002
IEEE
‘ We take advantage of the hierarchical structure of the star graph network to obtain an efficient method for constructing node-disjoint paths between arbitrary pairs of nodes in...
156
click to vote
ACSD
1998
IEEE
15 years 10 months ago
1998
IEEE
State coding conflict detection is a fundamental part of synthesis of asynchronous concurrent systems from their specifications as Signal Transition Graphs (STGs), which are a spe...
161
click to vote
ISAAC
1998
Springer
15 years 10 months ago
1998
Springer
In this paper we present a randomized parallel algorithm to sample matchings from an almost uniform distribution on the set of matchings of all sizes in a graph. First we prove th...
192
click to vote
ICDM
2007
IEEE
15 years 10 months ago
2007
IEEE
The problems of object classification (labeling the nodes of a graph) and link prediction (predicting the links in a graph) have been largely studied independently. Commonly, obje...
172
click to vote
VL
1995
IEEE
15 years 9 months ago
1995
IEEE
Buffering of intermediate results in dataflow diagrams can significantly reduce latency when a user browses these results or re-executes a diagram with slightly different inputs. ...