Results 291 to 300 of about 47,591 (350)

Stigma and Rawlsian Liberalism

Journal of Social Philosophy, EarlyView.
Euan Allison
wiley   +1 more source

Linear-Time MaxCut in Multigraphs Parameterized Above the Poljak-Turzík Bound. [PDF]

Algorithmica
Lill J, Petrova K, Weber S.
europepmc   +1 more source

Fighting Organizational Degeneration Through a Right to Strike in Democratic Corporations

Journal of Social Philosophy, EarlyView.
Philipp Stehr
wiley   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Clique transversal and clique independence on comparability graphs

Information Processing Letters, 1996
Abstract We present O ( m √ n + M ( n )) algorithms for finding the clique transversal number and the clique independence number for a comparability graph of n nodes, where M ( n ) is the complexity of multiplying two n × n matrices.
C Pandu Rangan
exaly   +2 more sources

Index-Based Densest Clique Percolation Community Search in Networks

IEEE Transactions on Knowledge and Data Engineering, 2018
Long Yuan, Lu Qin, Wenjie Zhang
exaly   +2 more sources

Lightning Fast and Space Efficient k-clique Counting

The Web Conference, 2022
K-clique counting is a fundamental problem in network analysis which has attracted much attention in recent years. Computing the count of k-cliques in a graph for a large k (e.g., k = 8) is often intractable as the number of k-cliques increases ...
Xiaowei Ye, Ronghua Li, Qiangqiang Dai, Hongzhi Chen, Guoren Wang   +4 more
semanticscholar   +1 more source

KClist++: A Simple Algorithm for Finding k-Clique Densest Subgraphs in Large Graphs

Proceedings of the VLDB Endowment, 2020
The problem of finding densest subgraphs has received increasing attention in recent years finding applications in biology, finance, as well as social network analysis.
Bintao Sun, Maximilien Danisch, T-H. Hubert Chan, Mauro Sozio   +3 more
semanticscholar   +1 more source

Ordering heuristics for k-clique listing

Proceedings of the VLDB Endowment, 2020
Listing all k-cliques in a graph is a fundamental graph mining problem that finds many important applications in community detection and social network analysis.
Ronghua Li, Sen Gao, Lu Qin, Guoren Wang, Weihua Yang, J. Yu   +5 more
semanticscholar   +1 more source

On Clique-Transversals and Clique-Independent Sets

Annals of Operations Research, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Guillermo Durán 0001, Min Chih Lin, Jayme Luiz Szwarcfiter   +2 more
openaire   +2 more sources