A graph H is a minor of a second graph G if G can be transformed into H by two operations: 1) deleting nodes and/or edges, or 2) contracting edges. Coarse-grained reconfigurable array (CGRA) application mapping is closely related to the graph minor problem ...
Laser-induced forward transfer (LIFT) technique is an emerging micro additive manufacturing (AM) technique that has been widely used to print a variety of materials. Distinguished from other nozzle-based AM techniques, LIFT operates without the existence o ...
Mobile manipulator throwing is a promising method to increase the flexibility and efficiency of dynamic manipulation in factories. Its major challenge is to efficiently plan a feasible throw under a wide set of task specifications. We show that the mobile ...
Information retrieval (IR) systems such as search engines are important for people to find what they need among the tremendous amount of data available in their organization or on the Internet. These IR systems enable users to search in a large data collec ...
Graphs offer a simple yet meaningful representation of relationships between data. This
representation is often used in machine learning algorithms in order to incorporate structural
or geometric information about data. However, it can also be used in an i ...
Recent years have witnessed a rise in real-world data captured with rich structural information that can be better depicted by multi-relational or heterogeneous graphs.
However, research on relational representation learning has so far mostly focused on th ...
This paper deals with a main limitation of Markovian traffic assignment (MTA) models: when the network includes cyclic structures and the link costs are small enough, the fact that the MTA models assign traffic flows to all feasible paths causes computatio ...
Given two graphs H and F, the maximum possible number of copies of H in an F-free graph on n vertices is denoted by ex(n, H, F). We investigate the function ex(n, H, kF), where kF denotes k vertex disjoint copies of a fixed graph F. Our results include cas ...
Given a graph H and a set of graphs F, let ex(n, H, F) denote the maximum possible number of copies of H in an T-free graph on n vertices. We investigate the function ex(n, H, F), when H and members of F are cycles. Let C-k denote the cycle of length k and ...
An ordered graph H is a simple graph with a linear order on its vertex set. The corresponding Turan problem, first studied by Pach and Tardos, asks for the maximum number ex(
