Sciweavers

463 search results - page 19 / 93
» A General Framework for Graph Sparsification
Sort
View
CIAC
2010
Springer
234views Algorithms» more  CIAC 2010»
13 years 11 months ago
Enumerating Rooted Graphs with Reflectional Block Structures
In this paper, we consider an arbitrary class H of rooted graphs such that each biconnected component is given by a representation with reflectional symmetry, which allows a roote...
Bingbing Zhuang and Hiroshi Nagamochi
ICALP
2005
Springer
14 years 1 months ago
Spatial Logics for Bigraphs
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...
Giovanni Conforti, Damiano Macedonio, Vladimiro Sa...
DLT
2004
13 years 9 months ago
Recognizable Sets of Graphs, Hypergraphs and Relational Structures: A Survey
New results on the recognizability of sets of finite graphs, hypergraphs and relational structures are presented. The general framework of this research which associates tightly a...
Bruno Courcelle
SIGCSE
2004
ACM
110views Education» more  SIGCSE 2004»
14 years 1 months ago
An extensible framework for providing dynamic data structure visualizations in a lightweight IDE
A framework for producing dynamic data structure visualizations within the context of a lightweight IDE is described. Multiple synchronized visualizations of a data structure can ...
T. Dean Hendrix, James H. Cross II, Larry A. Barow...
KBSE
2010
IEEE
13 years 5 months ago
Model comparison with GenericDiff
This paper proposes GenericDiff, a general framework for model comparison. The main idea is to separate the specification of domain-specific model properties and syntax from the g...
Zhenchang Xing