Sciweavers

200 search results - page 23 / 40
» ipl 2006
Sort
View
IPL
2010
111views more  IPL 2010»
14 years 8 months ago
Connecting face hitting sets in planar graphs
We show that any face hitting set of size n of a connected planar graph with a minimum degree of at least 3 is contained in a connected subgraph of size 5n − 6. Furthermore we s...
Pascal Schweitzer, Patrick Schweitzer
IPL
2010
80views more  IPL 2010»
14 years 8 months ago
The reachability problem for branching vector addition systems requires doubly-exponential space
Branching vector addition systems are an extension of vector addition systems where new reachable vectors may be obtained by summing two reachable vectors and adding an integral v...
Ranko Lazic
IPL
2010
95views more  IPL 2010»
14 years 8 months ago
Resource bisimilarity and graded bisimilarity coincide
Resource bisimilarity has been proposed in the literature on concurrency theory as a notion of bisimilarity over labeled transition systems that takes into account the number of c...
Luca Aceto, Anna Ingólfsdóttir, Josh...
IPL
2010
74views more  IPL 2010»
14 years 8 months ago
The repeater tree construction problem
A tree-like substructure on a computer chip whose task it is to carry a signal from a source circuit to possibly many sink circuits and which consists only of wires and so-called ...
Christoph Bartoschek, Stephan Held, Jens Maß...
IPL
2007
91views more  IPL 2007»
14 years 9 months ago
Simple deterministic wildcard matching
We present a simple and fast deterministic solution to the string matching with don’t cares problem. The task is to determine all positions in a text where a pattern occurs, all...
Peter Clifford, Raphaël Clifford