Sciweavers

1805 search results - page 95 / 361
» Functional programming with structured graphs
Sort
View
POPL
2010
ACM
14 years 8 months ago
From Program Verification to Program Synthesis
This paper describes a novel technique for the synthesis of imperative programs. Automated program synthesis has the potential to make programming and the design of systems easier...
Saurabh Srivastava, Sumit Gulwani, Jeffrey S. Fost...
ICIP
2009
IEEE
13 years 8 months ago
Windows and facades retrieval using similarity on graph of contours
The development of street-level geoviewers become recently a very active and challenging research topic. In this context, the detection, representation and classification of windo...
Jean-Emmanuel Haugeard, Sylvie Philipp-Foliguet, F...
TOMS
2010
106views more  TOMS 2010»
13 years 9 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
ICALP
2010
Springer
14 years 2 months ago
Testing 2-Vertex Connectivity and Computing Pairs of Vertex-Disjoint s-t Paths in Digraphs
We present an O(m + n)-time algorithm that tests if a given directed graph is 2-vertex connected, where m is the number of arcs and n is the number of vertices. Based on this resul...
Loukas Georgiadis
GG
2004
Springer
14 years 4 months ago
Workshop on Graph-Based Tools
Graphs are well-known, well-understood, and frequently used means to depict networks of related items. They are successfully used as the underlying mathematical concept in various ...
Tom Mens, Andy Schürr, Gabriele Taentzer