654 search results - page 25 / 131 » Matrix Graph Grammars |
ICALP
2007
Springer
14 years 3 months ago
2007
Springer
The ability to detect ambiguities in context-free grammars is vital for their use in several fields, but the problem is undecidable in the general case. We present a safe, conser...
FOCS
2010
IEEE
13 years 6 months ago
2010
IEEE
Let G be a directed edge-weighted graph and let P be a shortest path from s to t in G. The replacement paths problem asks to compute, for every edge e on P, the shortest s-to-t pat...
WALCOM
2008
IEEE
13 years 10 months ago
2008
IEEE
In this paper, a fast algorithm is proposed to calculate kth power of an n
ENGL
2007
13 years 8 months ago
2007
JPDC
1998
13 years 8 months ago
1998
