1327 search results - page 95 / 266 » Path following algorithm for the graph matching problem |
125
Voted
FOCS
2009
IEEE
15 years 8 months ago
2009
IEEE
— We study the complexity of rationalizing network formation. In this problem we fix an underlying model describing how selfish parties (the vertices) produce a graph by making...
171
click to vote
SECON
2010
IEEE
14 years 11 months ago
2010
IEEE
Nodes in a cognitive radio mesh network may select from a set of available channels to use provided they do not interfere with primary users. This ability can improve overall netwo...
102
Voted
NIPS
2008
15 years 3 months ago
2008
We continue our study of online prediction of the labelling of a graph. We show a fundamental limitation of Laplacian-based algorithms: if the graph has a large diameter then the ...
123
click to vote
ICOIN
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. In optical networks, traffic demands often demonstrate periodic nature for which time-overlapping property can be utilized in routing and wavelength assignment (RWA). A R...
145
click to vote
CIKM
2007
Springer
15 years 8 months ago
2007
Springer
Regular path queries (RPQ’s) are given by means of regular expressions and ask for matching patterns on labeled graphs. RPQ’s have received great attention in the context of s...