Sciweavers

1188 search results - page 69 / 238
» Extended Graph Unification
Sort
View
TOMS
2010
106views more  TOMS 2010»
13 years 8 months ago
Computing Tutte Polynomials
The Tutte polynomial of a graph, also known as the partition function of the q-state Potts model, is a 2-variable polynomial graph invariant of considerable importance in both comb...
Gary Haggard, David J. Pearce, Gordon Royle
ECEASST
2010
13 years 7 months ago
Checking Graph-Transformation Systems for Confluence
d Abstract) Detlef Plump Abstract. In general, it is undecidable whether a terminating graphtransformation system is confluent or not. We introduce the class of coverable hypergrap...
Detlef Plump
ENTCS
2006
142views more  ENTCS 2006»
13 years 10 months ago
Predicate Diagrams for the Verification of Real-Time Systems
We propose a format of predicate diagrams for the verification of real-time systems. We consider systems that are defined as extended timed graphs, a format that combines timed au...
Eun-Young Kang, Stephan Merz
WSDM
2009
ACM
187views Data Mining» more  WSDM 2009»
14 years 4 months ago
Speeding up algorithms on compressed web graphs
A variety of lossless compression schemes have been proposed to reduce the storage requirements of web graphs. One successful approach is virtual node compression [7], in which of...
Chinmay Karande, Kumar Chellapilla, Reid Andersen
AGTIVE
2003
Springer
14 years 3 months ago
Integrating Graph Rewriting and Standard Software Tools
OptimixJ is a graph rewrite tool that can be embedded easily into the standard software process. Applications and models can be developed in Java or UML and extended by graph rewri...
Uwe Aßmann, Johan Lövdahl