A communication problem and directed triple systems
From MaRDI portal
Recommendations
- A theory of higher order communicating systems
- A three-party communication problem
- scientific article; zbMATH DE number 3843756
- scientific article; zbMATH DE number 2146643
- Communication tree problems
- Extended directed triple systems
- Possibility and complexity of probabilistic reliable communication in directed networks
- Communication complexity in a 3-computer model
- On large sets of directed triple systems
Cites work
- scientific article; zbMATH DE number 434691 (Why is no real title available?)
- scientific article; zbMATH DE number 3943824 (Why is no real title available?)
- scientific article; zbMATH DE number 3685495 (Why is no real title available?)
- Networks communicating for each pairing of terminals
- The Analysis of Directed Triple Systems by Refinement
- Three-regular path pairable graphs
Cited in
(5)- Terminal-pairability in complete bipartite graphs
- Decomposition of bipartite graphs into special subgraphs
- Three messages are not optimal in worst case interactive communication
- The terminal-pairability problem in complete bipartite graphs
- Terminal-pairability in complete bipartite graphs with non-bipartite demands. Edge-disjoint paths in complete bipartite graphs
This page was built for publication: A communication problem and directed triple systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1392553)
