We consider the problem of maintaining a dynamic planar graph subject to edge insertions and edge deletions that preserve planarity but that can change the embedding. We describe a...
David Eppstein, Zvi Galil, Giuseppe F. Italiano, T...
The name `graph state' is used to describe a certain class of pure quantum state which models a physical structure on which one can perform measurement-based quantum computin...
Constanza Riera, Stéphane Jacob, Matthew G. Parke...
Background: The proliferation of structural and functional studies of RNA has revealed an increasing range of RNA's structural repertoire. Toward the objective of systematic ...
Daniela Fera, Namhee Kim, Nahum Shiffeldrim, Julie...
Propagation-based call graph construction algorithms have been studied intensively in the 1990s, and differ primarily in the number of sets that are used to approximate run-time v...
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...