1736 search results - page 117 / 348 » On antimagic directed graphs |
156
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical prop...
155
click to vote
GC
2010
Springer
15 years 4 months ago
2010
Springer
A directed graph has a natural Z-module homomorphism from the underlying graph’s cycle space to Z where the image of an oriented cycle is the number of forward edges minus the n...
163
click to vote
GC
2008
Springer
15 years 6 months ago
2008
Springer
For a directed graph G without loops or parallel edges, let (G) denote the size of the smallest feedback arc set, i.e., the smallest subset X E(G) such that G \ X has no directed...
153
click to vote
EMNLP
2006
15 years 7 months ago
2006
We consider the problem of constructing a directed acyclic graph that encodes temporal relations found in a text. The unit of our analysis is a temporal segment, a fragment of tex...
167
click to vote
VLDB
2004
ACM
15 years 11 months ago
2004
ACM
Link analysis methods show that the interconnections between web pages have lots of valuable information. The link analysis methods are, however, inherently oriented towards analy...