672 search results - page 37 / 135 » A General Solution to the Graph History Interaction Problem |
FOCS
2000
IEEE
13 years 11 months ago
2000
IEEE
Abstract. In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given ...
JCC
2007
13 years 7 months ago
2007
Abstract: The physical interactions among electrons and nuclei, responsible for the chemistry of atoms and molecules, is well described by quantum mechanics and chemistry is theref...
SIGMOD
2010
ACM
13 years 6 months ago
2010
ACM
Given a graph database D and a query graph g, an exact subgraph matching query asks for the set S of graphs in D that contain g as a subgraph. This type of queries find important...
DAC
2003
ACM
14 years 8 months ago
2003
ACM
This paper presents a novel partial assignment technique (PAT) that decides which tasks should be assigned to the same resource without explicitly defining assignment of these tas...
ALGORITHMICA
2007
13 years 7 months ago
2007
In this paper we study the problems of detecting holes and antiholes in general undirected graphs, and we present algorithms for these problems. For an input graph G on n vertices ...