Sciweavers

3267 search results - page 457 / 654
» Generalized quasirandom graphs
Sort
View
DAM
2007
85views more  DAM 2007»
15 years 6 months ago
Further mathematical properties of Cayley digraphs applied to hexagonal and honeycomb meshes
In this paper, we extend known relationships between Cayley digraphs and their subgraphs and coset graphs with respect to subgroups to obtain a number of general results on homomo...
Wenjun Xiao, Behrooz Parhami
DM
2007
86views more  DM 2007»
15 years 6 months ago
Short cycle connectivity
Short cycle connectivity is a generalization of ordinary connectivity—two vertices have to be connected by a sequence of short cycles, in which two consecutive cycles have at le...
Vladimir Batagelj, Matjaz Zaversnik
IANDC
2007
123views more  IANDC 2007»
15 years 6 months ago
Hardness of fully dense problems
In the past decade, there has been a stream of work in designing approximation schemes for dense instances of NP-Hard problems. These include the work of Arora, Karger and Karpins...
Nir Ailon, Noga Alon
IJNSEC
2007
127views more  IJNSEC 2007»
15 years 6 months ago
Markov Chain Modelling of the Probabilistic Packet Marking Algorithm
In this work, we show that the current termination condition of the Probabilistic Packet Marking (PPM) algorithm is not correct for general networks, and this implies the estimati...
Tsz-Yeung Wong, John Chi-Shing Lui, Man Hon Wong
JAIR
2007
112views more  JAIR 2007»
15 years 6 months ago
Cutset Sampling for Bayesian Networks
The paper presents a new sampling methodology for Bayesian networks that samples only a subset of variables and applies exact inference to the rest. Cutset sampling is a network s...
Bozhena Bidyuk, Rina Dechter