1688 search results - page 69 / 338 » The Complexity of Rationalizing Matchings |
147
click to vote
STOC
2010
ACM
15 years 10 months ago
2010
ACM
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
124
Voted
COLING
1996
15 years 6 months ago
1996
This paper presents an efficient algorithm for retrieving from a database of trees, all trees that match a given query tree appro,imately, that is, within a certain error toleranc...
110
click to vote
ATAL
2010
Springer
15 years 6 months ago
2010
Springer
For an agent to intelligently use specifications of executable protocols, it is necessary that the agent can quickly and correctly assess the outcomes of that protocol if it is ex...
161
click to vote
JCP
2006
15 years 5 months ago
2006
Finding a maximum cardinality matching in a graph is a problem appearing in numerous settings. The problem asks for a set of edges of maximum cardinality, such that no two edges of...
137
click to vote
TCAD
2008
15 years 5 months ago
2008
Boolean matching is one of the enabling techniques for technology mapping and logic resynthesis of Field Programmable Gate Array (FPGA). SAT-based Boolean matching (SAT-BM) has bee...