Sciweavers

595 search results - page 29 / 119
» The Graph Programming Language GP
Sort
View
ICALP
2003
Springer
14 years 26 days ago
Generating Labeled Planar Graphs Uniformly at Random
Abstract. We present an expected polynomial time algorithm to generate a labeled planar graph uniformly at random. To generate the planar graphs, we derive recurrence formulas that...
Manuel Bodirsky, Clemens Gröpl, Mihyun Kang
LICS
2009
IEEE
14 years 2 months ago
Pointer Programs and Undirected Reachability
Pointer programs are a model of structured computation within logspace. They capture the common description of logspace algorithms as programs that take as input some structured d...
Martin Hofmann, Ulrich Schöpp
VL
1994
IEEE
154views Visual Languages» more  VL 1994»
13 years 11 months ago
Stretch-A-Sketch: a Dynamic Diagrammer
Stretch-A-Sketch is a pen-based drawing program that combines recognition of hand-drawn glyphs with constraint based maintenance of spatial relations. The recognition program iden...
Mark D. Gross
VISSOFT
2005
IEEE
14 years 1 months ago
The Dominance Tree in Visualizing Software Dependencies
Dominance analysis from graph theory allows one to locate subordinated software elements in a rooted dependency graph. It identifies the nesting structure for a dependency graph ...
Raimar Falke, Raimund Klein, Rainer Koschke, Joche...
IPPS
2010
IEEE
13 years 5 months ago
Executing task graphs using work-stealing
Abstract--NABBIT is a work-stealing library for execution of task graphs with arbitrary dependencies which is implemented as a library for the multithreaded programming language Ci...
Kunal Agrawal, Charles E. Leiserson, Jim Sukha