Algorithms and Experiments for Clique Relaxations—Finding Maximum s-Plexes

2009 ◽  
pp. 233-244 ◽  
Author(s):  
Hannes Moser ◽  
Rolf Niedermeier ◽  
Manuel Sorge
Keyword(s):  
Clique Relaxations

Clique Relaxations in Social Network Analysis: The Maximumk-Plex Problem

2011 ◽  
Vol 59 (1) ◽  
pp. 133-142 ◽  
Author(s):  
Balabhaskar Balasundaram ◽  
Sergiy Butenko ◽  
Illya V. Hicks
Keyword(s):  
Social Network ◽  
Social Network Analysis ◽  
Network Analysis ◽  
Clique Relaxations

Abstract A25: Using clique relaxations to identify highly connected clusters in molecular networks in cancer.

2013 ◽  
Author(s):  
Lidia V. Kulemina ◽  
Grigory Pastukhov ◽  
Alexander Veremyev ◽  
Vladimir L. Boginski
Keyword(s):  
Molecular Networks ◽  
Clique Relaxations

scholarly journals Assessing the computational complexity of multilayer subgraph detection

2019 ◽  
Vol 7 (2) ◽  
pp. 215-241 ◽  
Author(s):  
Robert Bredereck ◽  
Christian Komusiewicz ◽  
Stefan Kratsch ◽  
Hendrik Molter ◽  
Rolf Niedermeier ◽  
...  
Keyword(s):  
Computational Complexity ◽  
Real World ◽  
Maximum Cardinality ◽  
Clique Relaxations ◽  
Vertex Set ◽  
Real World Problems

AbstractMultilayer graphs consist of several graphs, called layers, where the vertex set of all layers is the same but each layer has an individual edge set. They are motivated by real-world problems where entities (vertices) are associated via multiple types of relationships (edges in different layers). We chart the border of computational (in)tractability for the class of subgraph detection problems on multilayer graphs, including fundamental problems such as maximum-cardinality matching, finding certain clique relaxations, or path problems. Mostly encountering hardness results, sometimes even for two or three layers, we can also spot some islands of computational tractability.

Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations

2013 ◽  
Vol 56 (1) ◽  
pp. 113-130 ◽  
Author(s):  
Svyatoslav Trukhanov ◽  
Chitra Balasubramaniam ◽  
Balabhaskar Balasundaram ◽  
Sergiy Butenko
Keyword(s):  
Clique Relaxations

A network-based data mining approach to portfolio selection via weighted clique relaxations

2013 ◽  
Vol 216 (1) ◽  
pp. 23-34 ◽  
Author(s):  
Vladimir Boginski ◽  
Sergiy Butenko ◽  
Oleg Shirokikh ◽  
Svyatoslav Trukhanov ◽  
Jaime Gil Lafuente
Keyword(s):  
Data Mining ◽  
Portfolio Selection ◽  
Clique Relaxations ◽  
Data Mining Approach

Graph Theoretic Clique Relaxations and Applications

2013 ◽  
pp. 1559-1598 ◽  
Author(s):  
Balabhaskar Balasundaram ◽  
Foad Mahdavi Pajouh
Keyword(s):  
Clique Relaxations ◽  
Graph Theoretic
Sign in / Sign up

Export Citation Format

Share Document