721 search results - page 100 / 145 » Almost universal graphs |
AI
2011
Springer
13 years 5 months ago
2011
Springer
ating Abstract Argumentation with Classical Logic Arguments: Postulates and Properties Nikos Gorogiannisa , Anthony Hunterb,∗ aDepartment of Computer Science, Queen Mary, Univers...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge e of the gra...
PODC
2012
ACM
12 years 9 days ago
2012
ACM
This work presents a classification of weak models of distributed computing. We focus on deterministic distributed algorithms, and we study models of computing that are weaker ve...
VLDB
2004
ACM
14 years 3 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...
CALCO
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. Coalgebra automata, introduced by the second author, generalize the well-known automata that operate on infinite words/streams, trees, graphs or transition systems. This...