SIAMDM
2008
13 years 3 months ago
2008
Recently lexicographic breadth first search (LexBFS) has been shown to be a very powerful tool for the development of linear time, easily implementable recognition algorithms for v...
SIAMDM
2008
13 years 4 months ago
2008
Inspired by MacMahon's original proof of his celebrated theorem on the distribution of the major index over permutations, we give a reformulation of his argument in terms of l...
SIAMDM
2008
13 years 4 months ago
2008
A classical theorem by Tutte assures the existence of a Hamilton cycle in every finite 4-connected planar graph. Extensions of this result to infinite graphs require a suitable co...
SIAMDM
2008
13 years 4 months ago
2008
SIAMDM
2008
13 years 4 months ago
2008
Recently, a strong link has been discovered between supermodularity on lattices and tractability of optimization problems known as maximum constraint satisfaction problems. The pre...
SIAMDM
2008
13 years 4 months ago
2008
Given a graph G = (V, E) with node weights v N {0}, v V , and some number F N{0}, the convex hull of the incidence vectors of all cuts (S), S V with (S) F and (V \ S) F is ...
SIAMDM
2008
13 years 4 months ago
2008
SIAMDM
2008
13 years 4 months ago
2008
Given a partition of the vertices of a graph into two sets, a flip is a move of a vertex from its own set to the other, under the condition that it has more incident edges to vert...
SIAMDM
2008
13 years 4 months ago
2008
SIAMDM
2008
13 years 4 months ago
2008
We give exact expressions for the number of coset leaders in the cosets of weight 4 of binary primitive narrow sense Bose