Maximal independent set graph partitions for representations of body-centered cubic lattices

Research output: Contribution to journal › Journal article › Research › peer-review

Standard

Maximal independent set graph partitions for representations of body-centered cubic lattices. / Erleben, Kenny.

In: Visual Computer, Vol. 25, No. 5-7, 2009, p. 423-430.

Research output: Contribution to journal › Journal article › Research › peer-review

Harvard

Erleben, K 2009, 'Maximal independent set graph partitions for representations of body-centered cubic lattices', Visual Computer, vol. 25, no. 5-7, pp. 423-430. https://doi.org/10.1007/s00371-009-0330-8

APA

Erleben, K. (2009). Maximal independent set graph partitions for representations of body-centered cubic lattices. Visual Computer, 25(5-7), 423-430. https://doi.org/10.1007/s00371-009-0330-8

Vancouver

Erleben K. Maximal independent set graph partitions for representations of body-centered cubic lattices. Visual Computer. 2009;25(5-7):423-430. https://doi.org/10.1007/s00371-009-0330-8

Author

Erleben, Kenny. / Maximal independent set graph partitions for representations of body-centered cubic lattices. In: Visual Computer. 2009 ; Vol. 25, No. 5-7. pp. 423-430.

Bibtex

@article{48b1dfb0cf7a11dea1f3000ea68e967b,
title = "Maximal independent set graph partitions for representations of body-centered cubic lattices",
abstract = "A maximal independent set graph data structure for a body-centered cubic lattice is presented. Refinement and coarsening operations are defined in terms of set-operations resulting in robust and easy implementation compared to a quad-tree-based implementation. The graph only stores information corresponding to the leaves of a quad-tree thus has a smaller memory foot-print. The adjacency information in the graph relieves one from going up and down the quad-tree when searching for neighbors. This results in constant time complexities for refinement and coarsening operations.",
author = "Kenny Erleben",
year = "2009",
doi = "10.1007/s00371-009-0330-8",
language = "English",
volume = "25",
pages = "423--430",
journal = "Visual Computer",
issn = "0178-2789",
publisher = "Springer",
number = "5-7",

}

RIS

TY - JOUR

T1 - Maximal independent set graph partitions for representations of body-centered cubic lattices

AU - Erleben, Kenny

PY - 2009

Y1 - 2009

N2 - A maximal independent set graph data structure for a body-centered cubic lattice is presented. Refinement and coarsening operations are defined in terms of set-operations resulting in robust and easy implementation compared to a quad-tree-based implementation. The graph only stores information corresponding to the leaves of a quad-tree thus has a smaller memory foot-print. The adjacency information in the graph relieves one from going up and down the quad-tree when searching for neighbors. This results in constant time complexities for refinement and coarsening operations.

AB - A maximal independent set graph data structure for a body-centered cubic lattice is presented. Refinement and coarsening operations are defined in terms of set-operations resulting in robust and easy implementation compared to a quad-tree-based implementation. The graph only stores information corresponding to the leaves of a quad-tree thus has a smaller memory foot-print. The adjacency information in the graph relieves one from going up and down the quad-tree when searching for neighbors. This results in constant time complexities for refinement and coarsening operations.

U2 - 10.1007/s00371-009-0330-8

DO - 10.1007/s00371-009-0330-8

M3 - Journal article

VL - 25

SP - 423

EP - 430

JO - Visual Computer

JF - Visual Computer

SN - 0178-2789

IS - 5-7

ER -

ID: 15763377