scientific article; zbMATH DE number 17635

MaRDI QIDQ3974963zbMATH OpenFDO

Authors Edith Cohen, Nimrod Megiddo

Publication date 26 June 1992

zbMATH Keywords

spanning treebipartitenessrepetitive structureperiodic graphscompact representationrecognizing properties

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Recommendations

• Polynomial-Time Analysis of Toroidal Periodic Graphs
• Minimum Cost Paths in Periodic Graphs
• Crossing numbers of periodic graphs
• Polynomial time analysis of toroidal periodic graphs
• Planarity testing of doubly periodic infinite graphs

Cited in

(11)

• Crossing numbers of periodic graphs
• Planarity testing of doubly periodic infinite graphs
• Counter machines and crystallographic structures
• Polynomial time analysis of toroidal periodic graphs
• Using basis dependence distance vectors in the modified Floyd-Warshall algorithm
• Interactive 2D periodic graphs (media exposition)
• Computational aspects of M. C. Escher's ribbon patterns
• Velocity polytopes of periodic graphs and a no-go theorem for digital physics
• Polynomial-Time Analysis of Toroidal Periodic Graphs
• Smart contract-driven mechanism design to mitigate information diffusion in social networks
• Infinite geodesic paths and fibers, new topological invariants in periodic graphs

This page was built for publication:

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