677 search results - page 11 / 136 » Bipartite roots of graphs |
84
Voted
ISAAC
2004
Springer
15 years 5 months ago
2004
Springer
The k-Leaf Root problem is a particular case of graph power problems. Here, we study “error correction” versions of k-Leaf Root—that is, for instance, adding or deleting at m...
122
Voted
TCS
2011
14 years 7 months ago
2011
The problem of computing minimum distortion embeddings of a given graph into a line (path) was introduced in 2004 and has quickly attracted significant attention with subsequent ...
102
Voted
DAM
2006
15 years 14 days ago
2006
Abstract. Computing a maximum weighted stable set in a bipartite graph is considered wellsolved and usually approached with preflow-push, Ford-Fulkerson or network simplex algorith...
CORR
2006
Springer
15 years 14 days ago
2006
Springer
Abstract-- In this paper we consider the communication problem that involves transmission of correlated sources over broadcast channels. We consider a graph-based framework for thi...
102
Voted
ALGORITHMICA
2007
15 years 17 days ago
2007
A tree t-spanner T in a graph G is a spanning tree of G such that the distance between every pair of vertices in T is at most t times their distance in G. The tree t-spanner proble...