Covering complete graphs using the dancing links algorithm
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F23%3A10254544" target="_blank" >RIV/61989100:27240/23:10254544 - isvavai.cz</a>
Result on the web
<a href="https://www.scopus.com/record/display.uri?eid=2-s2.0-85175835533&origin=resultslist#funding-details" target="_blank" >https://www.scopus.com/record/display.uri?eid=2-s2.0-85175835533&origin=resultslist#funding-details</a>
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Covering complete graphs using the dancing links algorithm
Original language description
The dancing links algorithm by Knuth can be used to find decompositions of a complete graph efficiently. In this paper, we generalize it to find covers of a complete graph by cliques as well. This problem arose as one step of a parallel implementation of the bounded element method when solving partial differential equations. The modification brought up an issue of counting certain covers of multiple edges multiple times. Having solved the problem by imposing a natural order, we show the computational results achieved by the modified algorithm.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10102 - Applied mathematics
Result continuities
Project
—
Continuities
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2023
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
CEUR Workshop Proceedings. Volume 3498
ISBN
—
ISSN
1613-0073
e-ISSN
—
Number of pages
7
Pages from-to
"161 "- 167
Publisher name
ceur-ws.org
Place of publication
Aachen
Event location
Tatranské Matliare
Event date
Sep 22, 2023
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—