Sciweavers

3267 search results - page 160 / 654
» Generalized quasirandom graphs
Sort
View
SWAT
2004
Springer
156views Algorithms» more  SWAT 2004»
15 years 10 months ago
The Bottleneck Problem with Minimum Quantity Commitments
Given an edge-distance graph of a set of suppliers and clients, the bottleneck problem is to assign each client to a selected supplier minimizing their maximum distance. We introdu...
Andrew Lim, Zhou Xu
GCC
2003
Springer
15 years 10 months ago
Some Conclusions on Cayley Digraphs and Their Applications to Interconnection Networks
Abstract. In this short communication, we survey the relationships between Cayley digraphs and their subgraphs and coset graphs with respect to subgroups and obtain some general re...
Wenjun Xiao, Behrooz Parhami
COMBINATORICS
2006
142views more  COMBINATORICS 2006»
15 years 4 months ago
The Zeta Function of a Hypergraph
We generalize the Ihara-Selberg zeta function to hypergraphs in a natural way. Hashimoto's factorization results for biregular bipartite graphs apply, leading to exact factor...
Christopher K. Storm
JCT
2008
85views more  JCT 2008»
15 years 4 months ago
Smith normal form and Laplacians
Let M denote the Laplacian matrix of a graph G. Associated with G is a finite group (G), obtained from the Smith normal form of M, and whose order is the number of spanning trees o...
Dino J. Lorenzini
STACS
2010
Springer
15 years 11 months ago
Two-phase Algorithms for the Parametric Shortest Path Problem
Abstract. A parametric weighted graph is a graph whose edges are labeled with continuous real functions of a single common variable. For any instantiation of the variable, one obta...
Sourav Chakraborty, Eldar Fischer, Oded Lachish, R...