clique relaxations
Recently Published Documents


TOTAL DOCUMENTS

10
(FIVE YEARS 0)

H-INDEX

7
(FIVE YEARS 0)

2019 ◽  
Vol 7 (2) ◽  
pp. 215-241 ◽  
Author(s):  
Robert Bredereck ◽  
Christian Komusiewicz ◽  
Stefan Kratsch ◽  
Hendrik Molter ◽  
Rolf Niedermeier ◽  
...  

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.


2013 ◽  
Author(s):  
Lidia V. Kulemina ◽  
Grigory Pastukhov ◽  
Alexander Veremyev ◽  
Vladimir L. Boginski

2013 ◽  
Vol 216 (1) ◽  
pp. 23-34 ◽  
Author(s):  
Vladimir Boginski ◽  
Sergiy Butenko ◽  
Oleg Shirokikh ◽  
Svyatoslav Trukhanov ◽  
Jaime Gil Lafuente

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

Author(s):  
Balabhaskar Balasundaram ◽  
Foad Mahdavi Pajouh

2011 ◽  
Vol 59 (1) ◽  
pp. 133-142 ◽  
Author(s):  
Balabhaskar Balasundaram ◽  
Sergiy Butenko ◽  
Illya V. Hicks

Sign in / Sign up

Export Citation Format

Share Document