Copertina

Finding Densest Subgraphs with Edge-Color Constraints

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Oettershagen, Lutz, Wang, Honglian, Gionis, Aristides
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Social and Information Networks
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Fairness-aware PageRank via Edge Reweighting
di: Wang, Honglian, et al.
Pubblicazione: (2025)

Streaming Stochastic Submodular Maximization with On-Demand User Requests
di: Wang, Honglian, et al.
Pubblicazione: (2026)

Scalable Temporal Motif Densest Subnetwork Discovery
di: Sarpe, Ilie, et al.
Pubblicazione: (2024)

A Survey of Densest Subgraph Discovery on Large Graphs
di: Luo, Wensheng, et al.
Pubblicazione: (2023)

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

A Unified Core Structure in Multiplex Networks: From Finding the Densest Subgraph to Modeling User Engagement
di: Hashemi, Farnoosh, et al.
Pubblicazione: (2024)

Polaris: Sampling from the Multigraph Configuration Model with Prescribed Color Assortativity
di: Preti, Giulia, et al.
Pubblicazione: (2024)

An Edge-Based Decomposition Framework for Temporal Networks
di: Oettershagen, Lutz, et al.
Pubblicazione: (2023)

Forming Coordinated Teams that Balance Task Coverage and Expert Workload
di: Vombatkere, Karan, et al.
Pubblicazione: (2025)

The Vertex-Attribute-Constrained Densest $k$-Subgraph Problem
di: Lu, Qiheng, et al.
Pubblicazione: (2025)

Fair Minimum Labeling: Efficient Temporal Network Activations for Reachability and Equity
di: Oettershagen, Lutz, et al.
Pubblicazione: (2025)

Modeling the Impact of Timeline Algorithms on Opinion Dynamics Using Low-rank Updates
di: Zhou, Tianyi, et al.
Pubblicazione: (2024)

Q-DISCO: Query-Centric Densest Subgraphs in Networks with Opinion Information
di: Chen, Tianyi, et al.
Pubblicazione: (2024)

DSP: A Statistically-Principled Structural Polarization Measure
di: Preti, Giulia, et al.
Pubblicazione: (2025)

Hyperedge Modeling in Hypergraph Neural Networks by using Densest Overlapping Subgraphs
di: Soltani, Mehrad, et al.
Pubblicazione: (2024)

Inferring Tie Strength in Temporal Networks
di: Oettershagen, Lutz, et al.
Pubblicazione: (2022)

On Densest $k$-Subgraph Mining and Diagonal Loading: Optimization Landscape and Finite-Step Exact Convergence Analysis
di: Lu, Qiheng, et al.
Pubblicazione: (2024)

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

Efficient Banzhaf-Based Data Valuation for $k$-Nearest Neighbors Classification
di: Zhang, Guangyi, et al.
Pubblicazione: (2026)

Scalable Algorithm for Finding Balanced Subgraphs with Tolerance in Signed Networks
di: Chen, Jingbang, et al.
Pubblicazione: (2024)

Fairness-Aware Dense Subgraph Discovery
di: Kariotakis, Emmanouil, et al.
Pubblicazione: (2024)

Sequential Diversification with Provable Guarantees
di: Wang, Honglian, et al.
Pubblicazione: (2024)

Experimental Analysis and Evaluation of Cohesive Subgraph Discovery
di: Kim, Dahee, et al.
Pubblicazione: (2025)

Densest Subhypergraph: Negative Supermodular Functions and Strongly Localized Methods
di: Huang, Yufan, et al.
Pubblicazione: (2023)

Representation Learning for Frequent Subgraph Mining
di: Ying, Rex, et al.
Pubblicazione: (2024)

Tight Practical Bounds for Subgraph Densities in Ego-centric Networks
di: Mattes, Connor, et al.
Pubblicazione: (2025)

Dense Subgraph Clustering and a New Cluster Ensemble Method
di: Vu-Le, The-Anh, et al.
Pubblicazione: (2025)

Cohesive Subgraph Discovery in Hypergraphs: A Locality-Driven Indexing Framework
di: Kim, Song, et al.
Pubblicazione: (2025)

Beyond Trivial Edges: A Fractional Approach to Cohesive Subgraph Detection in Hypergraphs
di: Kim, Hyewon, et al.
Pubblicazione: (2024)

OptiRefine: Densest subgraphs and maximum cuts with $k$ refinements
di: Tu, Sijing, et al.
Pubblicazione: (2025)

GNN-based Anchor Embedding for Efficient Exact Subgraph Matching
di: Yang, Bin, et al.
Pubblicazione: (2025)

A Network Formation Model Based on Subgraphs
di: Chandrasekhar, Arun G., et al.
Pubblicazione: (2016)

A New Perspective to Node Influence Evaluation in Complex Network Using Subgraph Tr-Centrality
di: Amshi, Auwal Tijjani
Pubblicazione: (2020)

Simplifying Subgraph Representation Learning for Scalable Link Prediction
di: Louis, Paul, et al.
Pubblicazione: (2023)

An Improved Combinatorial Algorithm for Edge-Colored Clustering in Hypergraphs
di: Han, Seongjune, et al.
Pubblicazione: (2026)

Translating Subgraphs to Nodes Makes Simple GNNs Strong and Efficient for Subgraph Representation Learning
di: Kim, Dongkwan, et al.
Pubblicazione: (2022)

Subgraph Pooling: Tackling Negative Transfer on Graphs
di: Wang, Zehong, et al.
Pubblicazione: (2024)

Stochastic Degree Sequence Model with Edge Constraints (SDSM-EC) for Backbone Extraction
di: Neal, Zachary P., et al.
Pubblicazione: (2023)

GISExplainer: On Explainability of Graph Neural Networks via Game-theoretic Interaction Subgraphs
di: Xian, Xingping, et al.
Pubblicazione: (2024)

Relevance meets Diversity: A User-Centric Framework for Knowledge Exploration through Recommendations
di: Coppolillo, Erica, et al.
Pubblicazione: (2024)