The even adjacency split problem for graphs
From MaRDI portal
Publication:1566571
Recommendations
Cites work
- A data structure for manipulating priority queues
- A Linear Tree Partitioning Algorithm
- scientific article; zbMATH DE number 3172309 (Why is no real title available?)
- scientific article; zbMATH DE number 4141826 (Why is no real title available?)
- scientific article; zbMATH DE number 5531984 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 3603293 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1472175 (Why is no real title available?)
- scientific article; zbMATH DE number 908506 (Why is no real title available?)
- Implementation and Analysis of Binomial Queue Algorithms
- On the complexity of partitioning graphs into connected subgraphs
- On the construction of minimal broadcast networks
- Sparse broadcast graphs
- Tight Bounds on Mimimum Broadcast Networks
Cited in
(3)
This page was built for publication: The even adjacency split problem for graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1566571)