Sciweavers

250 search results - page 19 / 50
» Constructing a Class of Symmetric Graphs
Sort
View
GD
2003
Springer
14 years 1 months ago
The Puzzle Layout Problem
We address the new problem of puzzle layout as a new application of awing. We present two abstract models of puzzles, permutation puzzles and cyclic puzzles, which can be modeled a...
Kozo Sugiyama, Seok-Hee Hong, Atsuhiko Maeda
ISCC
2006
IEEE
127views Communications» more  ISCC 2006»
14 years 2 months ago
Visualizing and Managing Network Topologies via Rectangular Dualization
Rectangular dualization is an effective, hierarchically oriented visualization method for network topologies and can be used in many other problems having in common with networks ...
Massimo Ancona, Walter Cazzola, Sara Drago, Gianlu...
EDBT
2008
ACM
160views Database» more  EDBT 2008»
13 years 10 months ago
Taxonomy-superimposed graph mining
New graph structures where node labels are members of hierarchically organized ontologies or taxonomies have become commonplace in different domains, e.g., life sciences. It is a ...
Ali Cakmak, Gultekin Özsoyoglu
FFA
2006
116views more  FFA 2006»
13 years 8 months ago
Amorphic association schemes with negative Latin square-type graphs
Applying results from partial difference sets, quadratic forms, and recent results of Brouwer and Van Dam, we construct the first known amorphic association scheme with negative La...
James A. Davis, Qing Xiang
PODC
2011
ACM
12 years 11 months ago
Locally checkable proofs
This work studies decision problems from the perspective of nondeterministic distributed algorithms. For a yes-instance there must exist a proof that can be verified with a distri...
Mika Göös, Jukka Suomela