6598 search results - page 167 / 1320 » Graph Theory with Applications |
175
click to vote
TRS
2008
15 years 6 months ago
2008
In this paper, we discuss an approach to structural objects based on a generalisation of indiscernibility relation used in rough set theory. The existing results in rough set theor...
181
click to vote
AGTIVE
1999
Springer
15 years 10 months ago
1999
Springer
We discuss geometric positioning, highlighting of visited nodes and user defined highlighting that form the algorithm animation facilities in the Grrr graph rewriting programming l...
194
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Proof nets are a graph theoretical representation of proofs in various fragments of type-logical grammar. In spite of this basis in graph theory, there has been relatively little ...
165
click to vote
ENTCS
2008
15 years 6 months ago
2008
We define transactional graph transformation systems (t-gtss), a mild extension of the ordinary framework for the double-pushout approach to graph transformation, which allows to ...
164
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...