1357 search results - page 140 / 272 » Compositionality in Graph Transformation |
169
click to vote
WG
1998
Springer
15 years 10 months ago
1998
Springer
In this work we introduce the class of graphs with bounded induced distance of order k, (BID(k) for short). A graph G belongs to BID(k) if the distance between any two nodes in ev...
159
click to vote
FOCS
2005
IEEE
15 years 12 months ago
2005
IEEE
The problem of characterizing all the testable graph properties is considered by many to be the most important open problem in the area of property-testing. Our main result in thi...
175
click to vote
WWW
2005
ACM
16 years 7 months ago
2005
ACM
In this note we consider a simple reformulation of the traditional power iteration algorithm for computing the stationary distribution of a Markov chain. Rather than communicate t...
183
click to vote
SOFTVIS
2003
ACM
15 years 11 months ago
2003
ACM
An active research area in telecommunications concerns how to specify and control the addition of new services, such as call waiting or instant messaging, into existing software. ...
163
click to vote
PEPM
2007
ACM
16 years 13 days ago
2007
ACM
XML graphs have shown to be a simple and effective formalism for representing sets of XML documents in program analysis. It has evolved through a six year period with variants tai...