5473 search results - page 714 / 1095 » On the graph isomorphism problem |
160
Voted
STOC
2009
ACM
16 years 7 months ago
2009
ACM
We study integrality gaps for SDP relaxations of constraint satisfaction problems, in the hierarchy of SDPs defined by Lasserre. Schoenebeck [25] recently showed the first integra...
206
click to vote
RECOMB
2006
Springer
16 years 7 months ago
2006
Springer
This paper proposes a parameterized algorithm for aligning two protein structures, in the case where one protein structure is represented by a contact map graph and the other by a ...
199
click to vote
PODC
2009
ACM
16 years 1 months ago
2009
ACM
We study communication complexity of consensus in synchronous message-passing systems with processes prone to crashes. The goal in the consensus problem is to have all the nonfaul...
172
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
: Given a logical topology and a physical topology , the survivable logical topology design problem in an IP-overWDM optical network is to map the logical links into lightpaths in ...
190
click to vote
INFOCOM
2008
IEEE
16 years 1 months ago
2008
IEEE
—Rate allocation is a fundamental problem in the operation of a wireless network because of the necessity to schedule the operation of mutually interfering links between the node...