[HTML][HTML] Computational aspects of monotone dualization: A brief survey
Dualization of a monotone Boolean function represented by a conjunctive normal form
(CNF) is a problem which, in different disguise, is ubiquitous in many areas including …
(CNF) is a problem which, in different disguise, is ubiquitous in many areas including …
[كتاب][B] Social and economic networks
MO Jackson - 2008 - nber.org
Social'and'Economic' Networks' Page 1 Social'and'Economic' Networks' ! ! ! ! ! ! ! Matthew O.
Jackson Copyright: Matthew O. Jackson 2014 Please do not post or distribute without …
Jackson Copyright: Matthew O. Jackson 2014 Please do not post or distribute without …
[كتاب][B] Network analysis: methodological foundations
U Brandes - 2005 - books.google.com
'Network'is a heavily overloaded term, so that 'network analysis' means different things to
different people. Specific forms of network analysis are used in the study of diverse …
different people. Specific forms of network analysis are used in the study of diverse …
The maximum clique problem
The maximum clique problem is a classical problem in combinatorial optimization which
finds important applications in different domains. In this paper we try to give a survey of …
finds important applications in different domains. In this paper we try to give a survey of …
Listing all maximal cliques in large sparse real-world graphs
We modify an algorithm of Bron and Kerbosch [1973] for maximal clique enumeration to
choose more carefully the order in which the vertices are processed, giving us a fixed …
choose more carefully the order in which the vertices are processed, giving us a fixed …
[كتاب][B] Boolean functions: Theory, algorithms, and applications
Y Crama, PL Hammer - 2011 - books.google.com
Written by prominent experts in the field, this monograph provides the first comprehensive,
unified presentation of the structural, algorithmic and applied aspects of the theory of …
unified presentation of the structural, algorithmic and applied aspects of the theory of …
[كتاب][B] Multicriteria scheduling: theory, models and algorithms
V T'kindt, JC Billaut - 2006 - books.google.com
Scheduling and multicriteria optimisation theory have been subject, separately, to numerous
studies. Since the last twenty years, multicriteria scheduling problems have been subject to …
studies. Since the last twenty years, multicriteria scheduling problems have been subject to …
The maximum clique problem
In this paper we present a survey of results concerning algorithms, complexity, and
applications of the maximum clique problem. We discuss enumerative and exact algorithms …
applications of the maximum clique problem. We discuss enumerative and exact algorithms …
Listing all maximal cliques in sparse graphs in near-optimal time
The degeneracy of an n-vertex graph G is the smallest number d such that every subgraph
of G contains a vertex of degree at most d. We show that there exists a nearly-optimal fixed …
of G contains a vertex of degree at most d. We show that there exists a nearly-optimal fixed …
Comparing performance of algorithms for generating concept lattices
Recently concept lattices became widely used tools for intelligent data analysis. In this
paper, several algorithms that generate the set of all formal concepts and diagram graphs of …
paper, several algorithms that generate the set of all formal concepts and diagram graphs of …