Routes enumeration in a Boolean with respect to intersection and nonintersection relations

zbMATH Open0911.05003MaRDI QIDQ1280321FDOQ1280321

E. E. Marenich

Publication date: 15 March 1999

Published in: Moscow University Mathematics Bulletin (Search for Journal in Brave)

Recommendations

• Route systems and bipartite graphs
• Routing sets in the integer lattice
• Enumerating triangulation paths
• Intersection graphs of non-crossing paths
• Intersection graphs of non-crossing paths
• Non-intersecting detours in strong oriented graphs
• On devising Boolean Routing Schemes
• Intersection problems in the Boolean lattice
• Relational characterisations of paths
• Path intersection matrices and applications to networks

zbMATH Keywords

reduced algebra of binary functions

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15)

This page was built for publication: Routes enumeration in a Boolean with respect to intersection and nonintersection relations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1280321)