1395 search results - page 154 / 279 » (k, )-Distance-Hereditary Graphs |
147
click to vote
WADS
2009
Springer
15 years 10 months ago
2009
Springer
We present the first thorough theoretical analysis of the Transitivity Editing problem on digraphs. Herein, the task is to perform a minimum number of arc insertions or deletions ...
148
Voted
ESA
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. We obtain faster algorithms for problems such as rdimensional matching, r-set packing, graph packing, and graph edge packing when the size k of the solution is considered...
125
Voted
GD
2006
Springer
15 years 7 months ago
2006
Springer
The crossing number cr(G) of a graph G is the minimum number of crossings over all drawings of G in the plane. In 1993, Richter and Thomassen [RT93] conjectured that there is a co...
143
Voted
MOBIHOC
2008
ACM
16 years 3 months ago
2008
ACM
We study the multicast capacity of a random wireless network consisting of ordinary wireless nodes and base stations, known as a hybrid network. Assume that n ordinary wireless no...
160
click to vote
COCOON
1999
Springer
15 years 8 months ago
1999
Springer
We present results related to satisfying shortest path queries on a planar graph stored in external memory. Let N denote the number of vertices in the graph and let sort(N) denote...