The design, implementation and deployment of computer applications tightly integrated with complex, changing environments is a difficult task. This paper presents the Multigraph Architecture (MGA) developed for building complex embedded systems. The MGA is a meta-level architecture which includes tools and methods to create domain specific model integrated program synthesis environments. These ...

This paper presents HITS’ coreference resolution system that participated in the CoNLL2012 shared task on multilingual unrestricted coreference resolution. Our system employs a simple multigraph representation of the relation between mentions in a document, where the nodes correspond to mentions and the edges correspond to relations between the mentions. Entities are obtained via greedy cluster...

We study the decomposition of multigraphs with a constant edge multiplicity into copies of a fixed starH =K1,t :We present necessary and sufficient conditions for such a decomposition to exist where t = 2 and prove NP-completeness of the corresponding decision problem for any t 3.We also prove NP-completeness when the edge multiplicity function is not restricted either on the input G or on the ...

We introduce a closure concept that turns a claw-free graph into the line graph of a multigraph while preserving its (non-)Hamiltonconnectedness. As an application, we show that every 7-connected claw-free graph is Hamilton-connected, and we show that the wellknown conjecture by Matthews and Sumner (every 4-connected clawfree graph is hamiltonian) is equivalent with the statement that every 4-c...

Let G be a multigraph. We say that G is 1-extendable if every edge of G is contained in a 1-factor. Suppose G is 1-extendable. An excessive factorization of G is a set F = {F1, F2, . . . , Fr} of 1-factors of G whose union is E(G) and, subject to this condition, r is minimum. The integer r is called the excessive index of G and denoted by χ′e(G). Analogously, let m be a positive integer. We say...

This paper characterizes the injective and projective objects in the category of directed multigraphs, or quivers. Further, the injective envelope and projective cover of any quiver in this category is constructed.

The identification and mitigation of interdependencies among critical infrastructure elements such as telecommunications, energy and transportation are important steps in any protection strategy and are applicable in preventive and operative settings. This paper presents a graphtheoretical model and framework for analyzing dependencies based on a multigraph approach and discusses algorithms for...

Extensible Dependency Grammar (XDG) is new, modular grammar formalism for natural language. An XDG analysis is a multi-dimensional dependency graph, where each dimension represents a different aspect of natural language, e.g. syntactic function, predicate-argument structure, information structure etc. Thus, XDG brings together two recent trends in computational linguistics: the increased applic...