Imagen de Portada

Dense Subgraph Discovery Meets Strong Triadic Closure

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Arachchi, Chamalee Wickrama, Kumpulainen, Iiro, Tatti, Nikolaj
Formato:	Preprint
Publicado:	2025
Materias:	Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Node ranking in labeled networks
por: Arachchi, Chamalee Wickrama, et al.
Publicado: (2025)

Fair densest subgraph across multiple graphs
por: Arachchi, Chamalee Wickrama, et al.
Publicado: (2025)

Finding coherent node groups in directed graphs
por: Kumpulainen, Iiro, et al.
Publicado: (2023)

Max-Min Diversification with Asymmetric Distances
por: Kumpulainen, Iiro, et al.
Publicado: (2025)

The Densest SWAMP problem: subhypergraphs with arbitrary monotonic partial edge rewards
por: Bengali, Vedangi, et al.
Publicado: (2025)

Improved Hardness and Approximations for Cardinality-Based Minimum $s$-$t$ Cuts Problems in Hypergraphs
por: Adriaens, Florian, et al.
Publicado: (2024)

Approximating splits for decision trees quickly in sparse data streams
por: Tatti, Nikolaj
Publicado: (2026)

Fair Diversity Maximization with Few Representatives
por: Adriaens, Florian, et al.
Publicado: (2025)

Consistent Tie-Strength Labeling for Multilayer Strong Triadic Closure
por: Oettershagen, Lutz, et al.
Publicado: (2024)

Multilayer Correlation Clustering
por: Miyauchi, Atsushi, et al.
Publicado: (2024)

Temporal Triadic Closure: Finding Dense Structures in Social Networks That Evolve
por: Davot, Tom, et al.
Publicado: (2024)

A Branch-and-Bound Approach for Maximum Low-Diameter Dense Subgraph Problems
por: Zhou, Yi, et al.
Publicado: (2025)

An Efficient and Exact Algorithm for Locally h-Clique Densest Subgraph Discovery
por: Xu, Xiaojia, et al.
Publicado: (2024)

New Parameterized and Exact Exponential Time Algorithms for Strongly Connected Steiner Subgraph
por: Ameli, Afrouz Jabal, et al.
Publicado: (2026)

In-depth Analysis of Densest Subgraph Discovery in a Unified Framework
por: Zhou, Yingli, et al.
Publicado: (2024)

Finding Order-Preserving Subgraphs
por: Imamura, Haruya, et al.
Publicado: (2025)

Forbidden Subgraph Problems with Predictions
por: Böckenhauer, Hans-Joachim, et al.
Publicado: (2025)

Destroying Densest Subgraphs is Hard
por: Bazgan, Cristina, et al.
Publicado: (2024)

Counting Cohesive Subgraphs with Hereditary Properties
por: Li, Rong-Hua, et al.
Publicado: (2024)

Finding Small Complete Subgraphs Efficiently
por: Chen, Ke, et al.
Publicado: (2023)

Subexponential Parameterized Algorithms for Hitting Subgraphs
por: Lokshtanov, Daniel, et al.
Publicado: (2024)

Packing Compact Subgraphs with Applications to Districting
por: Chen, Ho-Lin, et al.
Publicado: (2026)

A Unified Approach for Approximating 2-Edge-Connected Spanning Subgraph and 2-Vertex-Connected Spanning Subgraph
por: Çivril, Ali
Publicado: (2023)

The Complexity Landscape of Dynamic Distributed Subgraph Finding
por: Chang, Yi-Jun, et al.
Publicado: (2024)

Scalable $k$-clique Densest Subgraph Search
por: Ye, Xiaowei, et al.
Publicado: (2024)

Simple Algorithms for Bad Triangle Transversals with Applications to Correlation Clustering
por: Adriaens, Florian, et al.
Publicado: (2026)

New Parallel and Streaming Algorithms for Directed Densest Subgraph
por: Mitrović, Slobodan, et al.
Publicado: (2025)

Accelerating Maximum Common Subgraph Computation by Exploiting Symmetries
por: Kothalawala, Buddhi, et al.
Publicado: (2026)

Almost Tight Bounds for Differentially Private Densest Subgraph
por: Dinitz, Michael, et al.
Publicado: (2023)

$Δ$-Motif: Parallel Subgraph Isomorphism via Tabular Operations
por: Wang, Yulun, et al.
Publicado: (2025)

Changing Induced Subgraph Isomorphisms Under Extended Reconfiguration Rules
por: Suga, Tatsuhiro, et al.
Publicado: (2025)

Better Decremental and Fully Dynamic Sensitivity Oracles for Subgraph Connectivity
por: Long, Yaowei, et al.
Publicado: (2024)

Finding Induced Subgraphs from Graphs with Small Mim-Width
por: Otachi, Yota, et al.
Publicado: (2024)

Shortcuts and Transitive-Closure Spanners Approximation
por: Chalermsook, Parinya, et al.
Publicado: (2025)

Parameterized Linear Time Transitive Closure
por: Kritikakis, Giorgos, et al.
Publicado: (2024)

Finding a Maximum Common (Induced) Subgraph: Structural Parameters Revisited
por: Hanaka, Tesshu, et al.
Publicado: (2025)

A Fine-grained Classification of Subquadratic Patterns for Subgraph Listing and Friends
por: Bringmann, Karl, et al.
Publicado: (2024)

Fast and Optimal Incremental Parametric Procedure for the Densest Subgraph Problem: An Experimental Study
por: Hochbaum, Dorit S., et al.
Publicado: (2025)

Efficient and Adaptive Estimation of Local Triadic Coefficients
por: Sarpe, Ilie, et al.
Publicado: (2025)

Multiplicative Weights Update, Area Convexity and Random Coordinate Descent for Densest Subgraph Problems
por: Nguyen, Ta Duy, et al.
Publicado: (2024)