Hypergraph Connectivity Augmentation in Strongly Polynomial Time.

Kristóf Bérczi Karthekeyan Chandrasekaran Tamás Király Shubhang Kulkarni

Published in: CoRR (2024)

Keyphrases

special case
hypertree decomposition
hypertree width
computational complexity
higher order
connected components
hypergraph model
pairwise
worst case
high order
finite automata
computer vision
np hard
np hardness
brain connectivity
neural network
databases