1101 search results - page 151 / 221 » An Algorithm for the Graph Crossing Number Problem |
149
Voted
DIALM
2005
ACM
15 years 4 months ago
2005
ACM
Reducing interference is one of the main challenges in wireless communication, and particularly in ad hoc networks. The amount of interference experienced by a node v corresponds ...
109
Voted
ICCAD
1995
IEEE
15 years 6 months ago
1995
IEEE
—A problem in technology mapping is that the quality of the final implementation depends significantly on the initially provided circuit structure. This problem is critical, es...
128
Voted
ICDCS
2009
IEEE
15 years 11 months ago
2009
IEEE
We consider the distributed complexity of the stable marriage problem. In this problem, the communication graph is undirected and bipartite, and each node ranks its neighbors. Giv...
291
click to vote
SIGMOD
2008
ACM
16 years 2 months ago
2008
ACM
Extracting dense sub-components from graphs efficiently is an important objective in a wide range of application domains ranging from social network analysis to biological network...
138
Voted
ICC
2007
IEEE
15 years 9 months ago
2007
IEEE
—Multichannel communication in a Wireless Mesh Network with routers having multiple radio interfaces significantly enhances the network capacity. Efficient channel assignment an...