Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A near optimal algorithm for edge separators (preliminary version)

From MaRDI portal
Publication:2817592
Jump to:navigation, search

DOI10.1145/195058.195077zbMath1345.05098OpenAlexW2073254216MaRDI QIDQ2817592

Shing Tung Yau, Fan R. K. Chung

Publication date: 1 September 2016

Published in: Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/195058.195077


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)


Related Items

Book embeddings and crossing numbers



Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2817592&oldid=15733872"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 19:13.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki