Density-Friendly Graph Decomposition

Forskningsoutput: Tidskriftsbidrag › Artikel › Vetenskaplig › Peer review

Originalspråk	engelska
Artikelnummer	54
Tidskrift	ACM Transactions on Knowledge Discovery from Data
Volym	13
Nummer	5
Antal sidor	29
ISSN	1556-4681
DOI	https://doi.org/10.1145/3344210
Status	Publicerad - okt. 2019
MoE-publikationstyp	A1 Tidskriftsartikel-refererad

Vetenskapsgrenar

@article{ccc3865bd57342c0bb1bc0ccc8b84d87,

title = "Density-Friendly Graph Decomposition",

keywords = "Locally-dense graph decomposition, fractional programming, max-flow, CLIQUES, 113 Computer and information sciences",

author = "Nikolaj Tatti",

year = "2019",

month = oct,

doi = "10.1145/3344210",

language = "English",

volume = "13",

journal = "ACM Transactions on Knowledge Discovery from Data",

issn = "1556-4681",

publisher = "Association for Computing Machinery",

number = "5",

}

TY - JOUR

T1 - Density-Friendly Graph Decomposition

AU - Tatti, Nikolaj

PY - 2019/10

Y1 - 2019/10

KW - Locally-dense graph decomposition

KW - fractional programming

KW - max-flow

KW - CLIQUES

KW - 113 Computer and information sciences

U2 - 10.1145/3344210

DO - 10.1145/3344210

M3 - Article

SN - 1556-4681

VL - 13

JO - ACM Transactions on Knowledge Discovery from Data

JF - ACM Transactions on Knowledge Discovery from Data

IS - 5

M1 - 54

ER -