328 search results - page 15 / 66 » Homomorphism bounded classes of graphs |
TIT
1998
13 years 8 months ago
1998
—We investigate a new class of codes for the optimal covering of vertices in an undirected graph Gsuch that any vertex in G can be uniquely identified by examining the vertices ...
EOR
2008
13 years 8 months ago
2008
Multicut is a fundamental network communication and connectivity problem. It is defined as: given an undirected graph and a collection of pairs of terminal vertices, find a minimu...
COLT
2006
Springer
14 years 5 days ago
2006
Springer
Bounds are given for the empirical and expected Rademacher complexity of classes of linear transformations from a Hilbert space H to a ...nite dimensional space. The results imply ...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
In this paper we present an algorithmic framework for solving a class of combinatorial optimization problems on graphs with bounded pathwidth. The problems are NP-hard in general, ...
CSR
2008
Springer
13 years 10 months ago
2008
Springer
A function f of a graph is called a complete graph invariant if two given graphs G and H are isomorphic exactly when f(G) = f(H). If additionally, f(G) is a graph isomorphic to G, ...