On structural parameterizations for the 2-club problem (Q2341718): Difference between revisions

Latest revision as of 01:06, 10 July 2024

scientific article; zbMATH DE number 6365531

On Structural Parameterizations for the 2-Club Problem

Language	Label	Description	Also known as
English	On structural parameterizations for the 2-club problem	scientific article; zbMATH DE number 6365531	On Structural Parameterizations for the 2-Club Problem

Statements

instance of

scholarly article

0 references

title

On structural parameterizations for the 2-club problem (English)

0 references

On Structural Parameterizations for the 2-Club Problem (English)

0 references

zbMATH Open document ID

1311.05051

0 references

1303.68093

0 references

DOI

10.1016/j.dam.2014.11.026

0 references

10.1007/978-3-642-35843-2_21

0 references

author

Sepp Hartung

0 references

Christian Komusiewicz

0 references

André Nichterlein

0 references

Ondřej Suchý

0 references

published in

Discrete Applied Mathematics

0 references

Lecture Notes in Computer Science

0 references

publication date

28 April 2015

0 references

4 November 2014

0 references

full work available at URL

https://arxiv.org/abs/1305.3735

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

clique relaxations

0 references

cohesive subnetworks

0 references

social network analysis

0 references

fixed-parameter tractability

0 references

parameter hierarchy

0 references

multivariate complexity analysis

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

0 references

0 references

A graph‐theoretic definition of a sociometric clique†

0 references

Integer models and upper bounds for the 3‐club problem

0 references

Approximating Maximum Diameter-Bounded Subgraphs

0 references

Novel approaches for analyzing biological networks

0 references

Emergence of Scaling in Random Networks

0 references

On problems without polynomial kernels

0 references

Kernel Bounds for Structural Parameterizations of Pathwidth

0 references

Heuristics for finding \(k\)-clubs in an undirected graph

0 references

An exact algorithm for the maximum \(k\)-club problem in an undirected graph

0 references

Graph Classes: A Survey

0 references

Upper bounds and heuristics for the 2-club problem

0 references

Finding large \(k\)-clubs in undirected graphs

0 references

Tight lower bounds for certain parameterized NP-hard problems

0 references

Fundamentals of parameterized complexity

0 references

The h-Index of a Graph and its Application to Dynamic Subgraph Statistics

0 references

On the parameterized complexity of multiple-interval graph problems

0 references

Towards fully multivariate algorithmics: parameter ecology and the deconstruction of computational complexity

0 references

Parametrized complexity theory.

0 references

Finding clubs in graph classes

0 references

Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs

0 references

On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal

0 references

New Races in Parameterized Algorithmics

0 references

On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs

0 references

Q5710169

0 references

Reflections on Multivariate Algorithmics and Problem Parameterization

0 references

Parameterized computational complexity of finding small-diameter subgraphs

0 references

A graph‐theoretic generalization of the clique concept

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2341718

@@ Property / cites work @@
+A graph‐theoretic definition of a sociometric clique†
+Normal rank
@@ Property / cites work @@
+Integer models and upper bounds for the 3‐club problem
+Normal rank
@@ Property / cites work @@
+Approximating Maximum Diameter-Bounded Subgraphs
@@ Property / cites work: Approximating Maximum Diameter-Bounded Subgraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Novel approaches for analyzing biological networks
+Normal rank
@@ Property / cites work @@
+Emergence of Scaling in Random Networks
@@ Property / cites work: Emergence of Scaling in Random Networks / rank @@
+Normal rank
@@ Property / cites work @@
+On problems without polynomial kernels
@@ Property / cites work: On problems without polynomial kernels / rank @@
+Normal rank
@@ Property / cites work @@
+Kernel Bounds for Structural Parameterizations of Pathwidth
+Normal rank
@@ Property / cites work @@
+Heuristics for finding \(k\)-clubs in an undirected graph
+Normal rank
@@ Property / cites work @@
+An exact algorithm for the maximum \(k\)-club problem in an undirected graph
+Normal rank
@@ Property / cites work @@
+Graph Classes: A Survey
@@ Property / cites work: Graph Classes: A Survey / rank @@
+Normal rank
@@ Property / cites work @@
+Upper bounds and heuristics for the 2-club problem
+Normal rank
@@ Property / cites work @@
+Finding large \(k\)-clubs in undirected graphs
@@ Property / cites work: Finding large \(k\)-clubs in undirected graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Tight lower bounds for certain parameterized NP-hard problems
+Normal rank
@@ Property / cites work @@
+Fundamentals of parameterized complexity
@@ Property / cites work: Fundamentals of parameterized complexity / rank @@
+Normal rank
@@ Property / cites work @@
+The h-Index of a Graph and its Application to Dynamic Subgraph Statistics
+Normal rank
@@ Property / cites work @@
+On the parameterized complexity of multiple-interval graph problems
+Normal rank
@@ Property / cites work @@
+Towards fully multivariate algorithmics: parameter ecology and the deconstruction of computational complexity
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Finding clubs in graph classes
@@ Property / cites work: Finding clubs in graph classes / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs
+Normal rank
@@ Property / cites work @@
+On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal
+Normal rank
@@ Property / cites work @@
+New Races in Parameterized Algorithmics
@@ Property / cites work: New Races in Parameterized Algorithmics / rank @@
+Normal rank
@@ Property / cites work @@
+On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+Reflections on Multivariate Algorithmics and Problem Parameterization
+Normal rank
@@ Property / cites work @@
+Parameterized computational complexity of finding small-diameter subgraphs
+Normal rank
@@ Property / cites work @@
+A graph‐theoretic generalization of the clique concept
+Normal rank