Sciweavers

94 search results - page 3 / 19
» On Regular Factors in Regular Graphs with Small Radius
Sort
View
VLDB
1990
ACM
116views Database» more  VLDB 1990»
13 years 9 months ago
Factoring Augmented Regular Chain Programs
In previous papers we have proposed a graphical query language for expressing traversal recursions in labelled, directed graphs. A fundamental feature of the language is the use o...
Peter T. Wood
IJPP
2011
99views more  IJPP 2011»
13 years 1 days ago
Regular Lattice and Small-World Spin Model Simulations Using CUDA and GPUs
Data-parallel accelerator devices such as Graphical Processing Units (GPUs) are providing dramatic performance improvements over even multicore CPUs for lattice-oriented applicatio...
Kenneth A. Hawick, Arno Leist, Daniel P. Playne
COMBINATORICS
2007
73views more  COMBINATORICS 2007»
13 years 5 months ago
A Short Proof of a Theorem of Kano and Yu on Factors in Regular Graphs
In this note we present a short proof of the following result, which is a slight extension of a nice 2005 theorem by Kano and Yu. Let e be an edge of an rregular graph G. If G has...
Lutz Volkmann
JCT
1998
122views more  JCT 1998»
13 years 4 months ago
Counting 1-Factors in Regular Bipartite Graphs
We show that any k-regular bipartite graph with 2n vertices has at least ((k−1)k−1 kk−2 )n perfect matchings (1-factors). Equivalently, this is a lower bound on the permanent...
Alexander Schrijver
DAM
2011
13 years 4 days ago
1-factor covers of regular graphs
sarah-marie belcastro, Michael Young