356 search results - page 2 / 72 » A Most General Edge Elimination Polynomial - Thickening of E... |
BIRTHDAY
2008
Springer
13 years 11 months ago
2008
Springer
A sequence of graphs Gn is iteratively constructible if it can be built from an initial labeled graph by means of a repeated fixed succession of elementary operations involving add...
SODA
2003
ACM
13 years 11 months ago
2003
ACM
Chung and Ross (SIAM J. Comput., 20, 1991) conjectured that the minimum number m(n, r) of middle-state switches for the symmetric 3-stage Clos network C(n, m(n, r), r) to be rearr...
MST
2010
13 years 8 months ago
2010
We study the sensitivity of equilibria in the well-known game theoretic traffic model due to Wardrop. We mostly consider single-commodity networks. Suppose, given a unit demand fl...
COCOA
2008
Springer
13 years 11 months ago
2008
Springer
We study the parameterized complexity of the following problem: is it possible to make a given graph r-regular by applying at most k elementary editing operations; the operations a...
ALGORITHMICA
2002
13 years 9 months ago
2002
A proper coloring of the edges of a graph G is called acyclic if there is no 2-colored cycle in G. The acyclic edge chromatic number of G, denoted by a (G), is the least number of...