654 search results - page 25 / 131 » Matrix Graph Grammars |
124
Voted
ICALP
2007
Springer
15 years 7 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...
139
click to vote
FOCS
2010
IEEE
14 years 11 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...
104
click to vote
WALCOM
2008
IEEE
15 years 2 months ago
2008
IEEE
In this paper, a fast algorithm is proposed to calculate kth power of an n
ENGL
2007
15 years 1 months ago
2007
JPDC
1998
15 years 1 months ago
1998
