Sciweavers

3757 search results - page 431 / 752
» The overlap number of a graph
Sort
View
IPCO
2010
184views Optimization» more  IPCO 2010»
15 years 8 months ago
Computing Minimum Multiway Cuts in Hypergraphs from Hypertree Packings
Hypergraph multiway cut problem is a problem of finding a minimum capacity set of hyperedges whose removal divides a given hypergraph into a specified number of connected componen...
Takuro Fukunaga
DAM
2006
47views more  DAM 2006»
15 years 6 months ago
Trees of extremal connectivity index
The connectivity index w(G) of a graph G is the sum of the weights (d(u)d(v)) of all edges uv of G, where is a real number ( = 0), and d(u) denotes the degree of the vertex u. Le...
Huiqing Liu, Mei Lu, Feng Tian
EOR
2006
82views more  EOR 2006»
15 years 6 months ago
Flowshop scheduling research after five decades
: All information systems have to be protected. As the number of information objects and the number of users increase the task of information system's protection becomes more ...
Jatinder N. D. Gupta, Edward F. Stafford
COMBINATORICS
1999
80views more  COMBINATORICS 1999»
15 years 6 months ago
On the Theory of Pfaffian Orientations. I. Perfect Matchings and Permanents
Kasteleyn stated that the generating function of the perfect matchings of a graph of genus g may be written as a linear combination of 4g Pfaffians. Here we prove this statement. ...
Anna Galluccio, Martin Loebl
JGT
2010
152views more  JGT 2010»
15 years 1 months ago
Cycles of even lengths modulo k
Thomassen [9] conjectured that for all natural numbers k > 0 and m, every graph of minimum degree k + 1 contains a cycle of length congruent to 2m modulo k. We prove that this ...
Ajit A. Diwan