43 search results - page 5 / 9 » Biconnectivity on Symbolically Represented Graphs: A Linear ... |
ICALP
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. We provide a framework for the design and analysis of dynamic programming algorithms for surface-embedded graphs on n vertices and branchwidth at most k. Our technique ap...
SIGSOFT
2006
ACM
15 years 10 months ago
2006
ACM
A method for extracting syntactic specifications from heapmanipulating code is described. The state of the heap is represented as an environment mapping each variable or field to ...
DM
2007
14 years 9 months ago
2007
Switch-setting games like Lights Out are typically modelled as a graph, where the vertices represent switches and lamps, and the edges capture the switching rules. We generalize t...
GECCO
2010
Springer
15 years 1 months ago
2010
Springer
This paper presents a new form of Genetic Programming called Cartesian Genetic Programming in which a program is represented as an indexed graph. The graph is encoded in the form o...
TIT
2010
14 years 4 months ago
2010
When there exists only a single multicast session in a directed acyclic/cyclic network, the existence of a network coding solution is characterized by the classic min-cut/max-flow ...