In this paper, we study the k-tree partition problem which is a partition of the set of edges of a graph into k edge-disjoint trees. This problem occurs at several places with appl...
Bipartite graphs appear in various scenes in the real world, and visualizing these graphs helps improve our understanding of network structures. The amount of information that is a...
Abstract. Xtatic is a lightweight extension of C offering native support for statically typed XML processing. XML trees are built-in values in Xtatic, and static analysis of the t...
Vladimir Gapeyev, Michael Y. Levin, Benjamin C. Pi...
The Graph Isomorphism problem restricted to graphs of bounded treewidth or bounded tree distance width are known to be solvable in polynomial time [2],[19]. We give restricted spa...
In this paper we describe a top-down approach to the segmentation and representation of documents containing tabular structures. Examples of these documents are invoices and techn...
Francesca Cesarini, Marco Gori, Simone Marinai, Gi...