Sciweavers

244 search results - page 4 / 49
» Balanced Cayley graphs and balanced planar graphs
Sort
View
CPM
2004
Springer
144views Combinatorics» more  CPM 2004»
14 years 2 months ago
A Simple Optimal Representation for Balanced Parentheses
We consider succinct, or highly space-efficient, representations of a (static) string consisting of n pairs of balanced parentheses, that support natural operations such as findi...
Richard F. Geary, Naila Rahman, Rajeev Raman, Venk...
ARSCOM
2006
140views more  ARSCOM 2006»
13 years 9 months ago
Expansion Properties Of Levi Graphs
ABSTRACT. The Levi graph of a balanced incomplete block design is the bipartite graph whose vertices are the points and blocks of the design, with each block adjacent to those poin...
Dominic Lanphier, C. Miller, Jason Rosenhouse, A. ...
JCT
2008
109views more  JCT 2008»
13 years 9 months ago
Decomposing Berge graphs and detecting balanced skew partitions
A hole in a graph is an induced cycle on at least four vertices. A graph is Berge if it has no odd hole and if its complement has no odd hole. In 2002, Chudnovsky, Robertson, Seym...
Nicolas Trotignon
ISSS
1996
IEEE
114views Hardware» more  ISSS 1996»
14 years 1 months ago
Flow Graph Balancing for Minimizing the Required Memory Bandwidth
In this paper we present the problem of flow graph balancing for minimizingthe required memory bandwidth. Our goal is to minimize the required memory bandwidth within the given cy...
Sven Wuytack, Francky Catthoor, Gjalt G. de Jong, ...