Q5111220 (Q5111220): Difference between revisions

From MaRDI portal

Jump to:navigation, search

← Older edit Newer edit →

Revision as of 18:15, 22 July 2024

scientific article; zbMATH DE number 7204340

Language	Label	Description	Also known as
English	No label defined	scientific article; zbMATH DE number 7204340

Statements

scholarly article

0 references

0 references

Ivan A. Bliznets

0 references

publication date

26 May 2020

0 references

full work available at URL

https://arxiv.org/abs/1706.09487

0 references

zbMATH Keywords

clustering

0 references

parameterized complexity

0 references

highly connected clusters

0 references

MaRDI profile type

MaRDI publication profile

0 references

Clique Relaxations in Social Network Analysis: The Maximum <i>k</i>-Plex Problem

0 references

Fourier meets M\"{o}bius: fast subset convolution

0 references

A Graph-Theoretic Approach to a Communications Problem

0 references

Simple upper bounds for partition functions

0 references

Tight bounds for parameterized complexity of cluster editing with a small number of clusters

0 references

Editing graphs into disjoint unions of dense clusters

0 references

A clustering algorithm based on graph connectivity

0 references

Finding Highly Connected Subgraphs

0 references

Exact combinatorial algorithms and experiments for finding maximum \(k\)-plexes

0 references

On the maximum quasi-clique problem

0 references

On clique relaxation models in network analysis

0 references

Distance-Based Clique Relaxations in Networks: s-Clique and s-Club

0 references

Identifiers

zbMATH Open document ID

0 references

10.4230/LIPIcs.MFCS.2017.6

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5111220

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5111220&oldid=36588229"