Sciweavers

9532 search results - page 71 / 1907
» Logic, Graphs, and Algorithms
Sort
View
WG
2009
Springer
15 years 11 months ago
Fully Dynamic Representations of Interval Graphs
We present a fully dynamic algorithm that maintains three different representations of an interval graph: a minimal interval model of the graph, the PQ-tree of its maximal cliques...
Christophe Crespelle
ALGORITHMICA
2006
103views more  ALGORITHMICA 2006»
15 years 4 months ago
Recognizing Hole-Free 4-Map Graphs in Cubic Time
We present a cubic-time algorithm for the following problem: Given a simple graph, decide whether it is realized by adjacencies of countries in a map without holes, in which at mo...
Zhi-Zhong Chen, Michelangelo Grigni, Christos H. P...
VMCAI
2010
Springer
16 years 1 months ago
Improved Model Checking of Hierarchical Systems
We present a unified game-based approach for branching-time model checking of hierarchical systems. Such systems are exponentially more succinct than standard state-transition gra...
Benjamin Aminof, Orna Kupferman, Aniello Murano
VTS
2006
IEEE
93views Hardware» more  VTS 2006»
15 years 10 months ago
Upper Bounding Fault Coverage by Structural Analysis and Signal Monitoring
A new algorithm for identifying stuck faults in combinational circuits that cannot be detected by a given input sequence is presented. Other than pre and post-processing steps, ce...
Vishwani D. Agrawal, Soumitra Bose, Vijay Gangaram
IV
2009
IEEE
128views Visualization» more  IV 2009»
15 years 11 months ago
Large Quasi-Tree Drawing: A Neighborhood Based Approach
In this paper, we present an algorithm to lay out a particular class of graphs coming from real case studies: the quasi-tree graph class. Protein and internet mappings projects ha...
Romain Bourqui, David Auber