On the Weisfeiler-Leman dimension of fractional packing

DOI10.1007/978-3-030-40608-0_25zbMATH Open1437.68134arXiv1910.11325OpenAlexW3013401877MaRDI QIDQ5896136FDOQ5896136

Authors: Vikraman Arvind, Frank Fuhlbrück, Oleg Verbitsky, Johannes Köbler 

Publication date: 27 July 2020

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Abstract: The $k$-dimensional Weisfeiler-Leman procedure ($k$-WL), which colors $k$-tuples of vertices in rounds based on the neighborhood structure in the graph, has proven to be immensely fruitful in the algorithmic study of Graph Isomorphism. More generally, it is of fundamental importance in understanding and exploiting symmetries in graphs in various settings. Two graphs are $k$-WL-equivalent if the $k$-dimensional Weisfeiler-Leman procedure produces the same final coloring on both graphs. 1-WL-equivalence is known as fractional isomorphism of graphs, and the $k$-WL-equivalence relation becomes finer as $k$ increases. We investigate to what extent standard graph parameters are preserved by $k$-WL-equivalence, focusing on fractional graph packing numbers. The integral packing numbers are typically NP-hard to compute, and we discuss applicability of $k$-WL-invariance for estimating the integrality gap of the LP relaxation provided by their fractional counterparts.

Full work available at URL: https://arxiv.org/abs/1910.11325

Recommendations

• On Weisfeiler-Leman invariance: subgraph counts and related graph properties
• Lov\'asz Meets Weisfeiler and Leman
• The power of the Weisfeiler-Leman algorithm to decompose graphs
• The Weisfeiler-Lehman procedure
• The Weisfeiler-Leman algorithm and recognition of graph properties

zbMATH Keywords

computational complexityfractional packingWeisfeiler-Leman algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Fractional graph theory, fuzzy graph theory (05C72) Parameterized complexity, tractability and kernelization (68Q27)

Cited In (8)

• Generalizations of \(k\)-dimensional Weisfeiler-Leman stabilization
• On Weisfeiler-Leman invariance: subgraph counts and related graph properties
• Local WL invariance and hidden shades of regularity
• The power of the Weisfeiler-Leman algorithm to decompose graphs
• The Weisfeiler-Leman dimension of chordal bipartite graphs without bipartite claw
• Identifiability of graphs with small color classes by the Weisfeiler-Leman algorithm
• On the Weisfeiler-Leman dimension of fractional packing
• The Weisfeiler-Lehman procedure

This page was built for publication: On the Weisfeiler-Leman dimension of fractional packing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5896136)