Sciweavers

1420 search results - page 91 / 284
» Representation of Graphs by OBDDs
Sort
View
JCT
2006
79views more  JCT 2006»
15 years 6 months ago
A characterization of cocircuit graphs of uniform oriented matroids
The cocircuit graph of an oriented matroid is the 1-skeleton of the cellular decomposition induced by the Topological Representation Theorem due to Folkman and Lawrence (1978) [J....
Juan José Montellano-Ballesteros, Ricardo S...
WG
2010
Springer
15 years 4 months ago
The Number of Bits Needed to Represent a Unit Disk Graph
We prove that for sufficiently large n, there exist unit disk graphs on n vertices such that for every representation with disks in the plane at least c √ n bits are needed to wr...
Colin McDiarmid, Tobias Müller
ICSM
2009
IEEE
16 years 1 months ago
Incremental call graph reanalysis for AspectJ software
Program call graph representation can be used to support many tasks in compiler optimization, program comprehension, and software maintenance. During software evolution, the call ...
Yu Lin, Sai Zhang, Jianjun Zhao
ICTAI
2000
IEEE
15 years 10 months ago
Consistency checking for Euclidean spatial constraints: a dimension graph approach
In this paper, we address the problem of consistency checking for Euclidean spatial constraints. A dimension graph representation is proposed to maintain the Euclidean spatial con...
Xuan Liu, Shashi Shekhar, Sanjay Chawla
CIAC
2010
Springer
234views Algorithms» more  CIAC 2010»
15 years 10 months ago
Enumerating Rooted Graphs with Reflectional Block Structures
In this paper, we consider an arbitrary class H of rooted graphs such that each biconnected component is given by a representation with reflectional symmetry, which allows a roote...
Bingbing Zhuang and Hiroshi Nagamochi