183 search results - page 21 / 37 » On the Matching Problem for Special Graph Classes |
118
click to vote
PLILP
1998
Springer
15 years 5 months ago
1998
Springer
Abstract. We address the problem of term normalisation modulo associativecommutative (AC) theories, and describe several techniques for compiling many-to-one AC matching and reduce...
109
click to vote
COMPGEOM
2006
ACM
15 years 7 months ago
2006
ACM
This paper addresses the problem of representing the connectivity information of geometric objects using as little memory as possible. As opposed to raw compression issues, the fo...
132
click to vote
TCS
2008
15 years 1 months ago
2008
This paper addresses the problem of representing the connectivity information of geometric objects using as little memory as possible. As opposed to raw compression issues, the fo...
147
click to vote
AAIM
2007
Springer
15 years 7 months ago
2007
Springer
Given an undirected graph G = (V, E) and a weight function w : E → Z+ , we consider the problem of orienting all edges in E so that the maximum weighted outdegree among all verti...
127
click to vote
APPROX
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. This paper investigates the relationship between the dimension theory of partial orders and the problem of scheduling precedenceconstrained jobs on a single machine to mi...