595 search results - page 58 / 119 » Incidence of |
142
click to vote
DAM
2010
15 years 6 months ago
2010
We consider the process of cleaning a network where at each time step, all vertices that have at least as many brushes as incident, contaminated edges, send brushes down these edg...
163
Voted
DM
2008
15 years 6 months ago
2008
A weighted graph is one in which every edge e is assigned a nonnegative number w(e), called the weight of e. The weight of a cycle is defined as the sum of the weights of its edge...
160
click to vote
COMBINATORICS
2006
15 years 6 months ago
2006
A set M of edges of a graph G is a matching if no two edges in M are incident to the same vertex. The matching number of G is the maximum cardinality of a matching of G. A set S o...
148
click to vote
IPL
2006
15 years 6 months ago
2006
The Arc-Preserving Subsequence (APS) problem appears in the comparison of RNA structures in computational biology. Given two arcannotated sequences of length n and m < n, APS a...
136
click to vote
JGT
2008
15 years 6 months ago
2008
Let G be a simple graph of order n with no isolated vertices and no isolated edges. For a positive integer w, an assignment f on G is a function f : E(G) {1, 2, . . . , w}. For a ...