Sciweavers

942 search results - page 33 / 189
» Constraints in Graph Drawing Algorithms
Sort
View
CORR
2004
Springer
177views Education» more  CORR 2004»
13 years 8 months ago
Typestate Checking and Regular Graph Constraints
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in ...
Viktor Kuncak, Martin C. Rinard
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
14 years 9 months ago
The PCP theorem by gap amplification
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
Irit Dinur
WADS
2009
Springer
255views Algorithms» more  WADS 2009»
14 years 3 months ago
Plane Graphs with Parity Constraints
Oswin Aichholzer, Thomas Hackl, Michael Hoffmann, ...
CIB
2005
125views more  CIB 2005»
13 years 8 months ago
An On-Line Web Visualization System with Filtering and Clustering Graph
A Web graph refers to the graph that is used to represent relationships between Web pages in cyberspace, where a node represents a URL and an edge indicates a link between two URLs...
Wei Lai, Xiaodi Huang, Ronald Wibowo, Jiro Tanaka
VL
2003
IEEE
146views Visual Languages» more  VL 2003»
14 years 1 months ago
A reading algorithm for constraint diagrams
Constraint diagrams are a visual notation designed to complement the Unified Modeling Language in the development of software systems. They generalize Venn diagrams and Euler cir...
Andrew Fish, Jean Flower, John Howse