Sciweavers

244 search results - page 17 / 49
» Balanced Cayley graphs and balanced planar graphs
Sort
View
IV
2005
IEEE
156views Visualization» more  IV 2005»
14 years 2 months ago
Applying Graphical Design Techniques to Graph Visualisation
This paper contains details of new criteria for graph layout, based on the concepts used in graphical design. Current graph layout criteria have been shown to be effective in meas...
Martyn Taylor, Peter Rodgers
SWAT
2004
Springer
156views Algorithms» more  SWAT 2004»
14 years 2 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
DAM
2006
73views more  DAM 2006»
13 years 9 months ago
Construction of sports schedules with multiple venues
A graph theoretical model is presented for constructing calendars for sports leagues where balancing requirement have to be considered with respect to the different venues where c...
Dominique de Werra, Tinaz Ekim, C. Raess
IMCSIT
2010
13 years 7 months ago
On the implementation of public keys algorithms based on algebraic graphs over finite commutative rings
We will consider balanced directed graphs, i.e., graphs of binary relations, for which the number of inputs and number of outputs are the same for each vertex. The commutative diag...
Michal Klisowski, Vasyl Ustimenko
CORR
2010
Springer
58views Education» more  CORR 2010»
13 years 7 months ago
Realizable Paths and the NL vs L Problem
A celebrated theorem of Savitch [Sav70] states that NSPACE(S) ⊆ DSPACE(S2 ). In particular, Savitch gave a deterministic algorithm to solve ST-CONNECTIVITY (an NL-complete probl...
Shiva Kintali