1998 search results - page 19 / 400 » Complexity of the Cover Polynomial |
STOC
2010
ACM
14 years 7 months ago
2010
ACM
We consider the problem of maintaining a large matching or a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge ins...
ESA
2004
Springer
14 years 3 months ago
2004
Springer
We consider a scenario where stops are to be placed along an already existing public transportation network in order to improve its attractiveness for the customers. The core probl...
DAM
2006
13 years 10 months ago
2006
Subtree filament graphs are the intersection graphs of subtree filaments in a tree. This class of graphs contains subtree overlap graphs, interval filament graphs, chordal graphs,...
JWSR
2007
13 years 9 months ago
2007
: We propose a framework and polynomial algorithms for semantic-based automated Web service composition, fully compliant with Semantic Web technologies. The approach exploits the r...
ECCC
2007
13 years 9 months ago
2007
We recover the first linear programming bound of McEliece, Rodemich, Rumsey, and Welch for binary error-correcting codes and designs via a covering argument. It is possible to sh...