… Exploring the theoretical and practical aspects of the graph isomorphism problem. …
CACM, 63(11):128-134, 10 2020. [doi]… Graph rewrite systems are often build to only transform graphs that are expressed using their internal graph modelling language. This prevents the use of the advanced techniques in graph rewriting on graphs or models that are not expressed …
In Proceedings of the Fujaba Days 2007 co-located with the 3rd International Workshop and Symposium on Applications of Graph Transformation with Industrial Relevance (AGTIVE 2007). 2007:… A partition graph is an intersection graph for a collection of subsets … of partition graphs are answered by recently discovered examples. An enumeration of the partition graphs on ten or fewer vertices is provided. …
DM, 113(1-3):255-258, 1993. [doi]… Graph database models can be defined as those in which data structures for the schema and instances are modeled as graphs or generalizations of them, and data manipulation is expressed by graph-oriented operations and type constructors …
ACM Comput. Surv., 40(1), 2008. [doi]… The Graph Minor Theorem of Robertson and Seymour establishes nonconstructively that many natural graph properties are characterized by a finite set … information about a family of graphs. The methods can be adapted to other partial …
TCS, 233(1-2):107-127, 2000. [doi]… Graph theory has its origin at a definite time and place, which is very unlike the other areas in mathematics - the Königsberg bridge problem, solved in 1736 by Leonhard Euler (Ralf, 1993), and Euler’s theorem for planar graphs, presented …
The Icfai University Journal of Computer Sciences, III(2), April 2009. [doi]… The complete list of forbidden minors (obstructions) for the family of graphs … the search space of graphs and how to simplify the process for deciding whether a graph is an obstruction for \VC{k}. The upper bounds $2k+1$ ($2k+2 …
cocoon 2000: 180-192 [doi]… We propose a new multilevel graph bi-partitioning approach (M-RRTS) using …. The original graph is summarized through a hierarchy of coarser graphs … are coalesced together. The coarsest graph is then partitioned, and uncoarsening …
amc, 318:227-244, 2018. [doi]… for directed graphs, even though such graphs are one of the most widely used data … to authenticate DAGs and directed cyclic graphs without leaking, which are the first such schemes in the literature. It is based on the structure of the graph …
edbt 2010: 609-620 [doi]… are guaranteed to exist by the Graph Minor Theorem. In this paper we characterize several families of graphs with small feedback sets, namely $k_1$-{\sc … compute obstruction sets for any minor-closed family of graphs, provided …
DM, 230(1-3):215-252, 2001. [doi]… generalization allowing the representation of term-graphs over an algebraic … analyses, e.g. based on control flow, require graph-like structures, the use of this formalism is a natural way of expressing them by graph rewriting. …
ENTCS, 203(1):3-17, 2008. [doi]… Graph-based intermediate representations (IRs) based solely on data flow have … to date with one of these IRs, the Value State Dependence Graph (VSDG), and show … potential future research with the graph, which we hope will inspire others …
WIR 2011: 53-60… A substantial part of graph theory’s history deals with the study and classification of sets of graphs that share common properties.
One predominant trend is to characterized graph families by sets of minimal forbidden graphs …
… . This merge protocol is given first as state machine and second as a set of graph rewrite … graph for all system configurations generated by the graph rewrite rules. Using … syntax and use a special generator to derive the corresponding graph rewrite rules …
TTC 2010:… This event is the second instance of the contest for graph transformation-based tools, which was first held as part of the AGTIVE workshop. The aim is to stimulate tool development by providing a sense of competitiveness, as well …
In Graph Transformations. 2008.… ) for families of graphs that are based on parameterized graph problems. Our main result shows that if the defining graph problem is \NP-complete then the growth rate … for the graph families with independence plus size at most $k$, $k \leq 12$. …
jucs, 3(11):1199-1206, 1997. [doi]… This paper presents a formal approach for managing unanticipated software evolution. Labelled typed nested graphs are used to represent arbitrarily complex software artifacts, and conditional graph rewriting is used for managing evolution …
agtive 2000: 127-143 [doi]… as a special kind of typed graph transformations using node type inheritance … transformations which behave like algebraic graph transformations. As a consequence, the rich theory of algebraic graph transformation can be applied to these EMF model …
MoDELS 2008: 53-67 [doi]… For the family of graphs with fixed-size vertex cover $k$, we present all of the forbidden minors (obstructions), for $k$ up to five. We derive some results, including a practical finite-state recognition algorithm, needed to compute …
ordal 1994: 86-99… The increasing importance of graph-data based applications is fueling the need for highly efficient and parallel implementations of graph analysis software … level language constructs allow developers to describe their graph analysis …
asplos 2012: 349-362 [doi]