231 search results - page 1 / 47 » Simulating Multigraph Transformations Using Simple Graphs |
ECEASST
2007
15 years 9 days ago
2007
92
Voted
ENTCS
2008
15 years 12 days ago
2008
In this paper, we define labeled multigraphs with ports, a graph model which specifies connection points for nodes and allows multiple edges and loops. The dynamic evolution of th...
STOC
2003
ACM
16 years 19 days ago
2003
ACM
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
79
Voted
DM
2010
15 years 13 days ago
2010
For d 1, s 0 a (d,d +s)-graph is a graph whose degrees all lie in the interval {d,d +1,...,d +s}. For r 1, a 0 an (r,r+1)-factor of a graph G is a spanning (r,r+a)-subgraph of...
97
Voted
APPROX
2004
Springer
15 years 5 months ago
2004
Springer
Consider the following communication problem, that leads to a new notion of edge coloring. The communication network is represented by a bipartite multigraph, where the nodes on o...