Vector clique decompositions

DOI10.1137/1.9781611975482.75zbMath1434.05126arXiv1902.00682OpenAlexW2902899417MaRDI QIDQ5236259

Raphael Yuster

Publication date: 15 October 2019

Published in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

polynomial time algorithminduced subgraphs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

This page was built for publication: Vector clique decompositions