Results 51 to 60 of about 5,334 (178)
Creating (Il)legal Markets: An Ethnography of the Insurance Market in Brazil
Journal of Illicit Economies and Development, 2019 This article analyzes the role of the insurance market in the conformation of state regulations, responsible for the creation of frontiers between legal and illegal practices in Brazil, with a focus on car insurance as well as the industry agents ...
Deborah Fromm
doaj +1 more source
As Strong as the Weakest Link:Mining Diverse Cliques in Weighted Graphs
, 2013 Mining for cliques in networks provides an essential tool for the discovery of strong associations among entities. Applications vary, from extracting core subgroups in team performance data arising in sports, entertainment, research and business; to the discovery of functional complexes in high-throughput gene interaction data.
Petko Bogdanov +4 more
openaire +3 more sources
On the strong p-Helly property
, 2008 The notion of strong p-Helly hypergraphs was introduced by Golumbic and Jamison in 1985 [M.C. Golumbic, R.E. Jamison, The edge intersection graphs of paths in a tree, J. Combin. Theory Ser. B 38 (1985) 8–22]. Independently, other authors [A.
Szwarcfiter, Jayme L. +2 more
core +1 more source
Persistent homology based Bottleneck distance in hypergraph products
Applied Network ScienceIn this paper, we extended the technique of measuring similarity between topological spaces using bottle neck distance between persistence diagrams to hypergraph networks. Finding a relationship between the bottleneck distance of the Cartesian product of
Archana Babu, Sunil Jacob John
doaj +1 more source
Crime, Power, and Authoritarian Capitalism: A Dystopian Realism Experiment
Journal of Illicit Economies and Development, 2019 The article contrasts the richness of academic production on illegal markets in Brazil to the obscurantist context of contemporary Brazilian politics. The text takes up the main topics of the Special Issue and faces a challenging question: considering ...
Luiz Eduardo Soares
doaj +1 more source
On the approximability of clique and related maximization problems
, 2003 We consider approximations of the form n1−o(1) for the Maximum Clique problem, where n is the number of vertices in the input graph and where the “o(1)” term goes to zero as n increases. We show that sufficiently strong negative results for such problems,
Srinivasan, Aravind, Aravind Srinivasan
core +1 more source
P-FPT algorithms for bounded clique-width graphs [PDF]
, 2019 International audienceRecently, hardness results for problems in P were achieved using reasonable complexity theoretic assumptions such as the Strong Exponential Time Hypothesis.
Coudert, David +2 more
core +1 more source
Algorithms for minimum covering by cliques and maximum clique in claw-free perfect graphs
, 1981 An algorithm is given for determining a minimum cardinality clique cover ongraphs that do not contain claws, odd holes or odd anti-holes. These graphs are also shown to be perfect so that we obtain a new proof of the strong perfect graph theorem for claw-
Nemhauser, George L. +3 more
core +1 more source
A network pharmacology study on analgesic mechanism of Yuanhu-Baizhi herb pair
BMC Complementary Medicine and Therapies, 2020 Background Millions of people are suffering from chronic pain conditions, such as headache, arthritis, cancer. Apart from western medicines, traditional Chinese medicines are also well accepted for pain management, especially in Asian countries.
Bobin Mi +4 more
doaj +1 more source
Strong Resolving Graphs of U-Clean Graphs of Finite Commutative Rings
Journal of MathematicsLet R be a finite commutative ring with identity 1. The U-clean graph U-ClR of a ring R is a simple undirected graph with vertices are of the form e,u, where e is a nonzero idempotent and u is a unit of R, and two distinct vertices e,u, f,v of U-ClR are ...
Ziyi Wu, Xiaobin Yin
doaj +1 more source