Solving Undirected Graph Problems on VLSI

DOI10.1137/0214040zbMath0565.68061OpenAlexW2028402722MaRDI QIDQ3680291

Susanne E. Hambrusch, Janos Simon

Publication date: 1985

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0214040

zbMATH Keywords

networksKolmogorov complexitylower boundoptimal algorithmundirected graphinformation flowconnected component problemVLSI complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15)

Related Items

Minimum vertex cover, distributed decision-making, and communication complexity ⋮ Representations of graphs and networks (coding, layouts and embeddings) ⋮ Communication complexity and combinatorial lattice theory

This page was built for publication: Solving Undirected Graph Problems on VLSI