93 search results - page 12 / 19 » The k-in-a-tree problem for graphs of girth at least k |
IWPEC
2009
Springer
14 years 1 months ago
2009
Springer
An induced matching in graph G is a matching which is an induced subgraph of G. Clearly, among two vertices with the same neighborhood (called twins) at most one is matched in any...
FSTTCS
2008
Springer
13 years 8 months ago
2008
Springer
Given an edge-weighted undirected graph G with a specified set of terminals, let the density of any subgraph be the ratio of its weight/cost to the number of terminals it contain...
IPPS
2005
IEEE
14 years 29 days ago
2005
IEEE
The problem of radio channel assignments with multiple levels of interference can be modeled using graph theory. Given a graph G, possibly infinite, and real numbers k1, k2, . . ...
CIKM
2009
Springer
14 years 1 months ago
2009
Springer
We consider the problem of releasing a limited public view of a sensitive graph which reveals at least k edges per node. We are motivated by Facebook’s public search listings, w...
RSA
2000
13 years 7 months ago
2000
The choice number ch(G) of a graph G = (V, E) is the minimum number k such that for every assignment of a list S(v) of at least k colors to each vertex v V , there is a proper ve...