Sciweavers

1830 search results - page 24 / 366
» Workshop on Graph Computation Models
Sort
View
WG
2007
Springer
14 years 1 months ago
Proper Helly Circular-Arc Graphs
A circular-arc model M = (C, A) is a circle C together with a collection A of arcs of C. If no arc is contained in any other then M is a proper circular-arc model, if every arc has...
Min Chih Lin, Francisco J. Soulignac, Jayme Luiz S...
WWW
2005
ACM
14 years 8 months ago
Incremental page rank computation on evolving graphs
Link Analysis has been a popular and widely used Web mining technique, especially in the area of Web search. Various ranking schemes based on link analysis have been proposed, of ...
Prasanna Kumar Desikan, Nishith Pathak, Jaideep Sr...
AINA
2009
IEEE
14 years 2 months ago
The Small-World Model for Amino Acid Interaction Networks
—In this paper we introduce the notion of protein interaction network. This is a graph whose vertices are the protein’s amino acids and whose edges are the interactions between...
Omar Gaci, Stefan Balev
LICS
2003
IEEE
14 years 27 days ago
Micro-Macro Stack Systems: A New Frontier of Elementary Decidability for Sequential Systems
We define the class of micro-macro stack graphs, a new class of graphs modeling infinite-state sequential systems with a decidable model-checking problem. Micro-macro stack grap...
Nir Piterman, Moshe Y. Vardi
SPAA
2006
ACM
14 years 1 months ago
Symmetric network computation
We introduce a simple new model of distributed computation — finite-state symmetric graph automata (FSSGA) — which captures the qualitative properties common to fault-toleran...
David Pritchard, Santosh Vempala