Sciweavers

4171 search results - page 75 / 835
» Choice numbers of graphs
Sort
View
IAJIT
2011
14 years 3 months ago
On the genus of pancake network
: Both the pancake graph and star graph are Cayley graphs and are especially attractive for parallel processing. They both have sublogarithmic diameter, and are fairly sparse compa...
Quan T. Nguyen, Saïd Bettayeb
ICCTA
2007
IEEE
15 years 3 months ago
What Graphs can be Efficiently Represented by BDDs?
We have carried out experimental research into implicit representation of large graphs using reduced ordered binary decision diagrams (OBDDs). We experimentally show that for grap...
Changxing Dong, Paul Molitor
PAM
2004
Springer
15 years 5 months ago
Geometric Exploration of the Landmark Selection Problem
Abstract. Internet coordinate systems appear promising as a method for estimating network distance without direct measurement, allowing scalable configuration of emerging applicat...
Liying Tang, Mark Crovella
ACCV
1998
Springer
15 years 4 months ago
Object Recognition by Matching Symbolic Edge Graphs
We present an object recognition system based on symbolic graphs with object corners as vertices and outlines as edges. Corners are determined in a robust way by a multiscale combi...
Tino Lourens, Rolf P. Würtz
SWAT
2010
Springer
250views Algorithms» more  SWAT 2010»
15 years 5 months ago
Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing
Given a permutation π of {1, . . . , n} and a positive integer k, we give an algorithm with running time 2O(k2 log k) nO(1) that decides whether π can be partitioned into at mos...
Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov...