Book ChapterDOI
Wiley‐Interscience Series in Discrete Mathematics and Optimization
János Pach,Pankaj K. Agarwal +1 more
- pp 355-356
About:
The article was published on 2011-10-28. It has received 309 citations till now. The article focuses on the topics: Series (mathematics).read more
Citations
More filters
MonographDOI
Random Graphs and Complex Networks
TL;DR: This chapter explains why many real-world networks are small worlds and have large fluctuations in their degrees, and why Probability theory offers a highly effective way to deal with the complexity of networks, and leads us to consider random graphs.
Journal ArticleDOI
On the Complexity of the Hybrid Proximal Extragradient Method for the Iterates and the Ergodic Mean
TL;DR: This paper analyzes the iteration complexity of the hybrid proximal extragradient (HPE) method for finding a zero of a maximal monotone operator recently proposed by Solodov and Svaiter and obtains new complexity bounds for Korpelevich's extrag Radient method which do not require the feasible set to be bounded.
Journal ArticleDOI
The complexity of temporal constraint satisfaction problems
Manuel Bodirsky,Jan Kára +1 more
TL;DR: This work presents a complete complexity classification of the constraint satisfaction problem (CSP) for temporal constraint languages: if the constraint language is contained in one out of nine temporal constraint language, then the CSP can be solved in polynomial time; otherwise, the C SP is NP-complete.
Journal ArticleDOI
The graph matching problem
Lorenzo Livi,Antonello Rizzi +1 more
TL;DR: This paper considers different classes of graphs that are roughly differentiated considering the complexity of the defined labels for both vertices and edges, aiming at explaining some significant instances of each graph matching methodology mainly considered in the technical literature.
Journal ArticleDOI
Benders Decomposition for the Hop-Constrained Survivable Network Design Problem
TL;DR: A thorough computational study of various branch-and-cut algorithms on a large set of instances including the real-based instances from SNDlib, able to solve the instances significantly faster than CPLEX 12 on the extended formulation.