scientific article; zbMATH DE number 17635

From MaRDI portal
Publication:3974963





[For the entire collection see Zbl 0726.00015.] A periodic graph is an infinite graph with a repetitive structure and a compact representation. In this paper algorithms are given to compute weakly connected components, to test bipartiteness, and to compute a minimum average cost spanning tree for \(d\)-dimensional 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)