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)

zbMATH Keywords

reduced algebra of binary functions

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15)

Recommendations

• Title not available (Why is that?) 👍 👎
• Path intersection matrices and applications to networks 👍 👎
• Enumerating triangulation paths 👍 👎
• Routing sets in the integer lattice 👍 👎
• On devising Boolean Routing Schemes 👍 👎
• Relational characterisations of paths 👍 👎
• Intersection graphs of non-crossing paths 👍 👎
• Intersection problems in the Boolean lattice 👍 👎
• Route systems and bipartite graphs 👍 👎
• Intersection graphs of non-crossing paths 👍 👎

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)