1206 search results - page 73 / 242 » Arc-Flags in Dynamic Graphs |
101
Voted
IPL
2007
15 years 18 days ago
2007
We deal with the problem of maintaining a dynamic graph so that queries of the form “is there an edge between u and v?” are processed fast. We consider graphs of bounded arbor...
106
click to vote
UAI
2003
15 years 2 months ago
2003
This paper introduces improved methodology to triangulate dynamic graphical models and dynamic Bayesian networks (DBNs). In this approach, a standard DBN template can be modified...
127
Voted
STACS
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. The problem of Subgraph Isomorphism is defined as follows: Given a pattern H and a host graph G on n vertices, does G contain a subgraph that is isomorphic to H? Eppstei...
114
Voted
PEPM
2007
ACM
15 years 6 months ago
2007
ACM
Functional Reactive Programming (frp) extends traditional functional programming with dataflow evaluation, making it possible to write interactive programs in a declarative style...
107
Voted
ICALP
2005
Springer
15 years 6 months ago
2005
Springer
Bigraphs are emerging as a (meta-)model for concurrent calculi, like CCS, ambients, πcalculus, and Petri nets. They are built orthogonally on two structures: a hierarchical place...