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

20 results for “graph linear notation”

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.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 →
cs.DMmath.COTheoreticalRecentJun 15, 2026

Encoding Phylogenetic Networks with Least Common Ancestor Constraints

Marc Hellmuth, Anna Lindeberg, Vincent Moulton

The paper studies encodings of phylogenetic networks based on least common ancestor constraints and identifies which parts of the network are determined by this relation.

View →
math.COcs.DMTheoreticalRecentJun 19, 2026

The Twin-Width of Graphs of Bounded VC-Dimension

Therese Biedl, Taite LaGrange, Sophie Spirkl

The paper investigates the twin-width of various hereditary classes of graphs and provides sub-linear bounds for graphs with bounded VC-dimension.

View →
cs.CCcs.DMmath.COTheoreticalRecentOct 25, 2026

Asymptotic Rank of Complete Graph Tensors

Huanyi Zhou

The paper studies the asymptotic rank of the tensor associated with the complete graph and provides upper and lower bounds.

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 →
math.COcs.DMTheoreticalRecentJul 18, 2026

Linear Turán Numbers of Uniform Hypertrees

Rajat Adak, Pragya Verma

This paper determines the linear Tur'an numbers for higher uniformity $r$-uniform linear hypergraphs and studies specific cases such as stars, hypertrees, and paths.

View →
cs.DScs.CCmath.COTheoreticalRecentOct 7, 2026

A deterministic algorithm for signing bipartite graphs at the Ramanujan bound

Zhiqiang Xu

The authors develop a deterministic polynomial-time algorithm for the Bilu--Linial signing problem on bipartite graphs.

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 →
cs.DMTheoreticalRecentJun 23, 2026

A Congestion Parameter for Depth-First Graph Traversals

Codaline Bourotte, Gwendal Ducloz, Pekka Orponen, Shinnosuke Seki

The paper introduces the KLX number, a new graph parameter, and provides characterizations and algorithms for graphs with KLX numbers 0, 1, and 2.

View →
math.COcs.DMTheoreticalRecentJul 19, 2026

Strong edge-colouring via local flag algebras

Eoin Davey, Eoin Hurley, Rémi de Joannis de Verclos, Ross J. Kang +1 more

This paper uses local flag algebra to prove bounds on the strong chromatic index of graphs, making progress towards established conjectures for general, bipartite, and asymmetric bipartite graphs.

View →
math.COcs.DMEmpiricalRecentOct 19, 2026

Invitation to torso parameters of annotated graphs

Maël Dumas, Jędrzej Hodor, Tomasz Mazur, Piotr Micek +2 more

Defines a new method for computing annotated graph parameters such as treewidth and treedepth

View →
cs.DCcs.CCcs.FLTheoreticalRecentJun 9, 2026

Generalizing LCL Complexity Gaps to Unbounded Degree via Monadic Second-Order Properties

Chiara Piombi

The authors extend the LOCAL model to unbounded degree graphs using Presburger monadic second-order (PMSO) formulas.

View →
cs.PLcs.MSTheoreticalRecentOct 30, 2026

Grassmann: The Coordinate-Independent Linear Algebra Programming Language

Theadora Fields Collin, Gilbert Bernstein, Oded Stein, Saman Amarasinghe

The paper proposes a language called Grassmann that bridges coordinate-independent linear algebra and coordinate-dependent implementations.

View →
math.COcs.CCTheoreticalRecentJul 21, 2026

Counting spanning quasi-trees of ribbon graphs: determinants and #P-completeness

William Whistler

This paper proves that counting quasi-trees in a connected ribbon graph is #P-complete.

View →