8647 search results - page 159 / 1730 » The Container Selection Problem |
124
click to vote
DAM
2007
15 years 3 months ago
2007
We study the following problem: Given a tree G and a finite set of trees H, find a subset O of the edges of G such that G − O does not contain a subtree isomorphic to a tree f...
133
Voted
LICS
2009
IEEE
15 years 10 months ago
2009
IEEE
The reachability problem for Vector Addition Systems (VASs) is a central problem of net theory. The general problem is known decidable by algorithms exclusively based on the class...
150
click to vote
EMMCVPR
2001
Springer
15 years 7 months ago
2001
Springer
The interest of graph matching techniques in the pattern recognition field is increasing due to the versatility of representing knowledge in the form of graphs. However, the size ...
152
click to vote
PRICAI
1998
Springer
15 years 7 months ago
1998
Springer
Many real-world constraint satisfaction problems (CSPs) can be over-constrained but contain a set of mandatory or hard constraints that have to be satisfied for a solution to be ac...
125
click to vote
IPCO
2010
15 years 4 months ago
2010
In the Steiner Network problem we are given a graph with edge-costs and connectivity requirements between node pairs , . The goal is to find a minimum-cost subgraph of that contain...