Sciweavers

874 search results - page 81 / 175
» Graph Transformation in a Nutshell
Sort
View
122
Voted
COMGEO
2004
ACM
15 years 3 months ago
How to draw the minimum cuts of a planar graph
We show how to utilize the cactus representation of all minimum cuts of a graph to visualize the minimum cuts of a planar graph in a planar drawing. In a first approach the cactus...
Ulrik Brandes, Sabine Cornelsen, Christian Fie&szl...
VLDB
1993
ACM
121views Database» more  VLDB 1993»
15 years 7 months ago
Integrity Constraint and Rule Maintenance in Temporal Deductive Knowledge Bases
The enforcement of semantic integrity constraints in data and knowledge bases constitutea a major performance bottleneck. Integrity constraint simplification methods aim at reduci...
Dimitris Plexousakis
126
Voted
FOCS
2005
IEEE
15 years 9 months ago
A Characterization of the (natural) Graph Properties Testable with One-Sided Error
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...
Noga Alon, Asaf Shapira
130
Voted
PEPM
2007
ACM
15 years 9 months ago
XML graphs in program analysis
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...
Anders Møller, Michael I. Schwartzbach
ICMCS
2005
IEEE
136views Multimedia» more  ICMCS 2005»
15 years 9 months ago
Soft Region Correspondence Estimation for Graph-Theoretic Image Retrieval Using Quadratic Programming Approach
This paper proposes employing a graph-theoretic approach to estimate the region correspondence between two images. We represent each image as an attributed undirected graph and tr...
Chuech-Yu Li, Chiou-Ting Hsu