505 search results - page 28 / 101 » On A Graph Formalism for Ordered Edges |
60
Voted
JCT
2007
14 years 9 months ago
2007
We prove results on the size of weakly and strongly separating set systems and matrices, and on cross-intersecting systems. As a consequence, we improve on a result of Katona and ...
71
Voted
ASPDAC
2005
ACM
14 years 11 months ago
2005
ACM
- We address the problem of implication of assertion graphs that occur in generalized symbolic trajectory evaluation (GSTE). GSTE has demonstrated its powerful capacity in formal v...
IJCAI
1989
14 years 10 months ago
1989
Several theories of grammar currently converge toward inserting subcategorization information within lexical entries. Such a tendency would benefit from a parsing algorithm able t...
ENDM
2002
14 years 9 months ago
2002
A graph G homogeneously embeds in a graph H if for every vertex x of G and every vertex y of H there is an induced copy of G in H with x at y. The graph G uniformly embeds in H if...
SOFSEM
2009
Springer
15 years 6 months ago
2009
Springer
During the last years, speed-up techniques for DIJKSTRA’s algorithm have been developed that make the computation of shortest paths a matter of microseconds even on huge road net...