Sciweavers

1425 search results - page 48 / 285
» Beyond Dependency Graphs
Sort
View
PODC
2010
ACM
13 years 12 months ago
Brief announcement: tree decomposition for faster concurrent data structures
We show how to partition data structures representable by directed acyclic graphs, i.e. rooted trees, to allow for efficient complex operations, which lie beyond inserts, deletes ...
Johannes Schneider, Roger Wattenhofer
ICPR
2004
IEEE
14 years 9 months ago
Graph Method for Generating Affine Moment Invariants
A general method of systematic derivation of affine moment invariants of any weights and orders is introduced. Each invariant is expressed by its generating graph. Techniques for ...
Jan Flusser, Tomás Suk
CIE
2006
Springer
13 years 11 months ago
On Graph Isomorphism for Restricted Graph Classes
Abstract. Graph isomorphism (GI) is one of the few remaining problems in NP whose complexity status couldn't be solved by classifying it as being either NP-complete or solvabl...
Johannes Köbler
STOC
2005
ACM
96views Algorithms» more  STOC 2005»
14 years 8 months ago
Every monotone graph property is testable
A graph property is called monotone if it is closed under taking (not necessarily induced) subgraphs (or, equivalently, if it is closed under removal of edges and vertices). Many ...
Noga Alon, Asaf Shapira
ICSM
2007
IEEE
14 years 2 months ago
System-level Usage Dependency Analysis of Object-Oriented Systems
Uncovering, modelling, and understanding architectural level dependencies of software systems is a key task for software maintainers. However, current dependency analysis techniqu...
Xinyi Dong, Michael W. Godfrey