Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
SIAMDM
2008
105views more  SIAMDM 2008»
12 years 4 days ago
A Simple Linear Time LexBFS Cograph Recognition Algorithm
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...
Anna Bretscher, Derek G. Corneil, Michel Habib, Ch...
SIAMDM
2008
69views more  SIAMDM 2008»
12 years 1 months ago
Labeled Partitions and the q-Derangement Numbers
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...
William Y. C. Chen, Deheng Xu
SIAMDM
2008
86views more  SIAMDM 2008»
12 years 1 months ago
Hamilton Cycles in Planar Locally Finite Graphs
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...
Henning Bruhn, Xingxing Yu
SIAMDM
2008
89views more  SIAMDM 2008»
12 years 1 months ago
Integer Exact Network Synthesis Problem
Santosh N. Kabadi, J. Yan, Donglei Du, K. P. K. Na...
SIAMDM
2008
90views more  SIAMDM 2008»
12 years 1 months ago
Maximizing Supermodular Functions on Product Lattices, with Application to Maximum Constraint Satisfaction
Recently, a strong link has been discovered between supermodularity on lattices and tractability of optimization problems known as maximum constraint satisfaction problems. The pre...
Andrei A. Krokhin, Benoit Larose
SIAMDM
2008
119views more  SIAMDM 2008»
12 years 1 months ago
On the Graph Bisection Cut Polytope
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 ...
Michael Armbruster, Christoph Helmberg, Marzena F&...
SIAMDM
2008
77views more  SIAMDM 2008»
12 years 1 months ago
Detecting a Theta or a Prism
Maria Chudnovsky, Rohan Kapadia
SIAMDM
2008
84views more  SIAMDM 2008»
12 years 1 months ago
Long Local Searches for Maximal Bipartite Subgraphs
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...
Hemanshu Kaul, Douglas B. West
SIAMDM
2008
114views more  SIAMDM 2008»
12 years 1 months ago
Split Hypergraphs
Ádám Timár
SIAMDM
2008
111views more  SIAMDM 2008»
12 years 1 months ago
On Cosets of Weight 4 of BCH(2m, 8), m Even, and Exponential Sums
We give exact expressions for the number of coset leaders in the cosets of weight 4 of binary primitive narrow sense Bose
Pascale Charpin, Tor Helleseth, Victor Zinoviev
books