356 search results - page 13 / 72 » A Most General Edge Elimination Polynomial - Thickening of E... |
105
click to vote
WG
2004
Springer
15 years 5 months ago
2004
Springer
In portable multimedia systems a number of communicating tasks has to be performed on a set of heterogeneous processors. This should be done in an energy-efficient way. We give th...
96
Voted
ESA
1999
Springer
15 years 4 months ago
1999
Springer
We propose a fast methodology for encoding graphs with information-theoretically minimum numbers of bits. Specifically, a graph with property π is called a π-graph. If π satis...
86
Voted
SODA
2010
ACM
15 years 9 months ago
2010
ACM
d Abstract) Hanna Mazzawi Technion - Israel Institute of Technology In this paper, we consider the problem of reconstructing a hidden graph with m edges using additive queries. Gi...
COMPGEOM
1995
ACM
15 years 3 months ago
1995
ACM
Abstract. We show that there is a matching between the edges of any two triangulations of a planar point set such that an edge of one triangulation is matched either to the identic...
93
Voted
DAM
2007
15 years 7 days ago
2007
We study the problem of uniformly partitioning the edge set of a tree with n edges into k connected components, where k ≤ n. The objective is to minimize the ratio of the maximu...