Open Access
Johnson: Computers and Intractability-A Guide to the Theory of NP-Completeness
Reads0
Chats0
About:
The article was published on 1979-01-01 and is currently open access. It has received 42654 citations till now. The article focuses on the topics: Completeness (order theory).read more
Citations
More filters
Journal ArticleDOI
Optimization by Simulated Annealing
TL;DR: There is a deep and useful connection between statistical mechanics and multivariate or combinatorial optimization (finding the minimum of a given function depending on many parameters), and a detailed analogy with annealing in solids provides a framework for optimization of very large and complex systems.
Book
Handbook of Applied Cryptography
TL;DR: A valuable reference for the novice as well as for the expert who needs a wider scope of coverage within the area of cryptography, this book provides easy and rapid access of information and includes more than 200 algorithms and protocols.
Journal ArticleDOI
Finding and evaluating community structure in networks.
TL;DR: It is demonstrated that the algorithms proposed are highly effective at discovering community structure in both computer-generated and real-world network data, and can be used to shed light on the sometimes dauntingly complex structure of networked systems.
Journal ArticleDOI
Complex networks: Structure and dynamics
TL;DR: The major concepts and results recently achieved in the study of the structure and dynamics of complex networks are reviewed, and the relevant applications of these ideas in many different disciplines are summarized, ranging from nonlinear science to biology, from statistical mechanics to medicine and engineering.
Journal ArticleDOI
Community detection in graphs
TL;DR: A thorough exposition of community structure, or clustering, is attempted, from the definition of the main elements of the problem, to the presentation of most methods developed, with a special focus on techniques designed by statistical physicists.
References
More filters
Journal ArticleDOI
A Way to Simplify Truth Functions
TL;DR: In this paper, a way to simplify truth functions is proposed. But it is difficult to verify the correctness of truth functions and it is not easy to find the truth functions in practice.
Proceedings Article
Area-Efficient Graph Layouts (for VLSI).
TL;DR: An algorithm is given that produces VLSI layouts for classes of graphs that have good separator theorems and shows in particular that any planar graph of n vertices has an O(n lg-square(n) area layout and that any tree of n Vertices can be laid out in linear area.
Journal ArticleDOI
Dynamic-Programming Algorithms for Recognizing Small-Bandwidth Graphs in Polynomial Time
TL;DR: In this paper, it was shown that the problem of testing the bandwidth of a graph is not NP-complete (unless P = NP) for any fixed k, answering an open question of Garey, Graham, Johnson, and Knuth.
Journal ArticleDOI
Tidy Drawings of Trees
C. Wetherell,A. Shannon +1 more
TL;DR: Two naive tree drawers are surveyed, formalize aesthetics for tidy trees, and two algorithms which draw tidy trees are discussed, one of which may be shown to require the minimum possible paper width.
Journal ArticleDOI
On the area of binary tree layouts
TL;DR: This note shows that it is not possible to design a complete binary tree layout with area O(n) and all leaves on the boundary, if the boundary of the chip is a convex plane curve and the leaves onThe boundary are separated by at least unit distance, then area of order nlogn is necessary just to accomodate all the wires.