Sciweavers

496 search results - page 14 / 100
» C4-saturated bipartite graphs
Sort
View
AAAI
2010
13 years 9 months ago
Propagating Conjunctions of AllDifferent Constraints
We study propagation algorithms for the conjunction of two ALLDIFFERENT constraints. Solutions of an ALLDIFFERENT constraint can be seen as perfect matchings on the variable/value...
Christian Bessiere, George Katsirelos, Nina Narody...
APPML
2008
159views more  APPML 2008»
13 years 7 months ago
The rook problem on saw-toothed chessboards
A saw-toothed chessboard, or STC for short, is a kind of chessboard whose boundary forms two staircases from left down to right without any hole inside it. A rook at square (i, j)...
Hon-Chan Chen, Ting-Yem Ho
ISCAS
1994
IEEE
93views Hardware» more  ISCAS 1994»
13 years 11 months ago
The Dynamic Locking Heuristic - A New Graph Partitioning Algorithm
In layout design nding e ciently good solutions to the hypergraph bipartitioning problem is of great importance. This paper introduces a new algorithm, the dynamic locking algorit...
Achim G. Hoffmann
ICTAI
2006
IEEE
14 years 1 months ago
Preserving Patterns in Bipartite Graph Partitioning
This paper describes a new bipartite formulation for word-document co-clustering such that hyperclique patterns, strongly affiliated documents in this case, are guaranteed not to ...
Tianming Hu, Chao Qu, Chew Lim Tan, Sam Yuan Sung,...
COMBINATORICS
2006
142views more  COMBINATORICS 2006»
13 years 7 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