Sciweavers

3268 search results - page 354 / 654
» The hub number of a graph
Sort
View
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
DCC
2005
IEEE
16 years 6 months ago
The Combinatorics of Dom de Caen
We give an overview of some of the mathematical results of Dominique de Caen. These include a short proof of K?onig's theorem, results on Tur?an numbers, biclique partitions,...
Edwin R. van Dam
SSDBM
1990
IEEE
89views Database» more  SSDBM 1990»
15 years 10 months ago
STORM: A Statistical Object Representation Model
In this paper we explore the structure and semantic properties of the entities stored in statistical databases. We call such entities "statistical objects" (SOS) and prop...
Maurizio Rafanelli, Arie Shoshani