Sciweavers

1420 search results - page 51 / 284
» Representation of Graphs by OBDDs
Sort
View
ECAI
2006
Springer
15 years 10 months ago
Compact Representation of Sets of Binary Constraints
Abstract. We address the problem of representing big sets of binary constraints compactly. Binary constraints in the form of 2literal clauses are ubiquitous in propositional formul...
Jussi Rintanen
ICRA
2006
IEEE
134views Robotics» more  ICRA 2006»
16 years 7 days ago
Hierarchical Map Building and Planning based on Graph Partitioning
— Mobile robot localization and navigation requires a map - the robot’s internal representation of the environment. A common problem is that path planning becomes very ineffic...
Zoran Zivkovic, Bram Bakker, Ben J. A. Kröse
ICSE
1995
IEEE-ACM
15 years 9 months ago
A Compact Petri Net Representation for Concurrent Programs
This paper presents a compact Petri net representation that is e cient to construct for concurrent programs that use explicit tasking and rendezvous style communication. These Pet...
Matthew B. Dwyer, Lori A. Clarke, Kari A. Nies
FOCS
2007
IEEE
16 years 16 days ago
Planning for Fast Connectivity Updates
Understanding how a single edge deletion can affect the connectivity of a graph amounts to finding the graph bridges. But when faced with d > 1 deletions, can we establish as ...
Mihai Patrascu, Mikkel Thorup
JGAA
2000
89views more  JGAA 2000»
15 years 6 months ago
Dynamic WWW Structures in 3D
We describe a method for three-dimensional straight-line representation of dynamic directed graphs (such as parts of the World Wide Web). It has been developed on the occasion of ...
Ulrik Brandes, Vanessa Kääb, Andres L&ou...