20 results for “graph linear notation”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
The paper introduces graph linear notation as an alternative definition for finite graphs, simplifying graph illustration and isomorphism comparison.
An approach is described to support rigid α canonical variables in an e-graph.
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.
The paper investigates the twin-width of various hereditary classes of graphs and provides sub-linear bounds for graphs with bounded VC-dimension.
The paper studies the asymptotic rank of the tensor associated with the complete graph and provides upper and lower bounds.
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.
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.
The authors develop a deterministic polynomial-time algorithm for the Bilu--Linial signing problem on bipartite graphs.
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.
The paper introduces the KLX number, a new graph parameter, and provides characterizations and algorithms for graphs with KLX numbers 0, 1, and 2.
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.
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
The authors extend the LOCAL model to unbounded degree graphs using Presburger monadic second-order (PMSO) formulas.
The paper proposes a language called Grassmann that bridges coordinate-independent linear algebra and coordinate-dependent implementations.
This paper proves that counting quasi-trees in a connected ribbon graph is #P-complete.