Sciweavers

505 search results - page 11 / 101
» On A Graph Formalism for Ordered Edges
Sort
View
ICALP
2007
Springer
15 years 3 months ago
On Commutativity Based Edge Lean Search
Exploring a graph through search is one of the most basic building blocks of various applications. In a setting with a huge state space, such as in testing and verification, optim...
Dragan Bosnacki, Edith Elkind, Blaise Genest, Doro...
DAM
2006
88views more  DAM 2006»
14 years 9 months ago
A characterization of triangle-free tolerance graphs
We prove that a triangle-free graph G is a tolerance graph if and only if there exists a set of consecutively ordered stars that partition the edges of G. Since tolerance graphs a...
Arthur H. Busch
SCP
2002
112views more  SCP 2002»
14 years 9 months ago
Formal agent-oriented modeling with UML and graph transformation
The agent paradigm can be seen as an extension of the notion of (active) objects by concepts like autonomy and cooperation. Mainstream object-oriented modeling techniques do not a...
Ralph Depke, Reiko Heckel, Jochen Malte Küste...
ICFCA
2004
Springer
15 years 3 months ago
Automated Lattice Drawing
Lattice diagrams, known as Hasse diagrams, have played an ever increasing role in lattice theory and fields that use lattices as a tool. Initially regarded with suspicion, they no...
Ralph Freese
SIAMDM
2010
149views more  SIAMDM 2010»
14 years 8 months ago
Formal Theory of Noisy Sensor Network Localization
Graph theory has been used to characterize the solvability of the sensor network localization problem. If sensors correspond to vertices and edges correspond to sensor pairs betwee...
Brian D. O. Anderson, Iman Shames, Guoqiang Mao, B...