No label defined (Q3974963)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 17635
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 17635 |
Statements
26 June 1992
0 references
recognizing properties
0 references
periodic graphs
0 references
repetitive structure
0 references
compact representation
0 references
bipartiteness
0 references
spanning tree
0 references
0.7893599271774292
0 references
0.769914448261261
0 references
0.7606309652328491
0 references
0.7528654932975769
0 references
0.7391912341117859
0 references
[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.
0 references