ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “Hypergraph-based representation”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.DMcs.DSmath.COTheoreticalRecentJun 16, 2026

An alternative way of defining finite graphs

Maxim Nazarov

The paper introduces graph linear notation as an alternative definition for finite graphs, simplifying graph illustration and isomorphism comparison.

View →
cs.ITTheoreticalRecentJun 11, 2026

Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling

Javad Maheri, K. K. Krishnan Namboodiri, Petros Elia

This paper identifies the fundamental limits of hypergraph edge partitioning and presents a near-optimal algorithm for a broad class of probabilistic hypergraph models.

View →
cs.DMTheoreticalRecentOct 19, 2026

Euclidean Embeddings of Acyclic Hypergraph Line Metrics

Nicholas Popescu

This paper studies Euclidean embeddings of higher-order line metrics arising from hypergraphs and improves the worst-case Euclidean distortion from Θ(log n) to Θ(√log log n) for α-acyclic hypergraphs.

View →
cs.PLEmpiricalRecentJun 22, 2026

Lifting E-Graphs: A Function Isn't a Constant

Philip Zucker

An approach is described to support rigid α canonical variables in an e-graph.

View →
stat.MLcs.CGcs.CLTheoreticalRecentJun 16, 2026

Compact Geometric Representations of Hierarchies

Prashant Gokhale, Piotr Indyk, Yuhao Liu, Sandeep Silwal +2 more

This paper investigates compact reachability embeddings for hierarchical data and provides theoretical guarantees for representing hierarchies using embeddings with dimensions dependent on graph param…

View →
cs.DMcs.DSmath.COTheoreticalRecentSep 29, 2026

The Reach of Abelian Covers in Hypergraphs

Joshua Brakensiek, Venkatesan Guruswami, Aaron Putterman

This paper introduces and studies novel covers of hypergraphs, Abelian and Catalan covers, to capture dependences between hyperedges.

View →
cs.AREmpiricalRecentJun 30, 2026

HySpecPro: Scalable Hypergraph Partitioning via Spectral Projection Optimization

Rongjian Liang, Zhuo Feng, Haoxing Ren

This paper introduces HySpecPro, a single-level hypergraph partitioner that performs end-to-end optimization in a spectral embedding space, delivering cut quality comparable to multilevel methods with…

View →
cs.AIcs.DBcs.IRRecentMay 29, 2026

Vector Linking via Cross-Model Local Isometric Consistency

Ziying Chen, Yang Cao, He Sun, Beining Yang +1 more

The paper proposes a novel geometric embedding hashing method to recover object correspondences (vector links) between two embedding clouds generated by different black-box encoders using only a small…

View →
math.COcs.CCcs.DMTheoreticalRecentJun 7, 2026

Fixed-Parameter Tractability of $t$-Uniform Hypergraphicality

Riley Brown, Istvan Miklos

The authors prove that the $t$-uniform hypergraphicality problem is fixed-parameter tractable parameterized by $(k,t)$, where $k$ is the number of distinct degrees.

View →
cs.HCEmpiricalRecentJul 15, 2026

ZipLine: Visual Analysis of Multivariate Graphs with Predicate Logic

Sjoerd Vink, Suyang Li, Brian Montambault, Michael Behrisch +2 more

This paper introduces ZipLine, a system for integrative analysis of multivariate graphs through a unified predicate language and learning algorithm.

View →
cs.DScs.IRTheoreticalRecentJun 22, 2026

Multi-Vector Embeddings are Provably More Expressive than Single Vector Embeddings

Rajesh Jayaram

This paper proves that single-vector embeddings require a larger representation size than multi-vector embeddings to approximate certain similarities.

View →
cs.DMTheoreticalRecentJul 8, 2026

Canonical Join Trees

Arne Leitert

This paper characterizes acyclic hypergraphs according to whether they admit unique canonical join trees as root and provides a linear-time algorithm to construct them.

View →
math.COcs.DMmath.CTTheoreticalRecentJul 9, 2026

Subword representations and weak hypercube dimension for acyclic categories

Isaac Carcacía-Campos

This paper introduces a new way to represent finite posets as subwords of finite words in categories, and characterizes the monic categories that admit this representation.

View →
cs.AREmpiricalRecentJun 16, 2026

IMPart: Integration of Memetic Operations into Multi-Level Framework for Large-k-Way Hypergraph Partitioning

Yugao Zhu, Zhicheng Guo, Shang Liu, Mengming Li +2 more

The paper proposes a novel memetic framework, IMPart, for k-way hypergraph partitioning that outperforms existing methods for large-k problems.

View →
cs.AIcs.ITcs.NIEmpiricalRecentJun 18, 2026

Implicit Semantic-Aware Communication Based on Hypergraph Reasoning

Yiwei Liao, Shurui Tu, Yong Xiao, Yingyu Li +1 more

This paper proposes a novel hypergraph-based framework for semantic-aware communication that improves semantic inference accuracy.

View →