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

An optimal algorithm for bisection for bounded-treewidth graph

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

DOI10.1007/978-3-030-59901-0_3OpenAlexW3089416906MaRDI QIDQ2037961

Yasuaki Kobayashi, Taiga Sone, Tesshu Hanaka

Publication date: 8 July 2021

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


zbMATH Keywords

treewidthfixed-parameter tractablebisection


Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)


Related Items (1)

A (probably) optimal algorithm for \textsc{bisection} on bounded-treewidth graphs






This page was built for publication: An optimal algorithm for bisection for bounded-treewidth graph

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