Étude de la séparation et de l'élimination sur une famille de graphes quotients déduite d'une méthode de dissections emboîtées

DOI10.1051/ITA/1988220202451MaRDI QIDQ3789083zbMATH OpenOpenAlexFDO

Authors

Publication date 1988

Published in RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/92308

zbMATH Keywords

communication graphquotient graphsdistributed implementationlarge sparse systems of linear equationsnested dissection orderingelimination graphbounded density graphtree of separators

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 4074330
• Algorithmique et calculs de complexité pour un solveur de type dissections emboîtées. (Algorithmic study and complexity bounds for a nested dissection solver)
• scientific article; zbMATH DE number 3843059
• The analysis of a nested dissection algorithm
• Calculs de complexité relatifs à une méthode de dissection emboîtée

Cites work

• scientific article; zbMATH DE number 3816913 (Why is no real title available?)
• scientific article; zbMATH DE number 3566098 (Why is no real title available?)
• scientific article; zbMATH DE number 3420184 (Why is no real title available?)
• A Separator Theorem for Chordal Graphs
• A Separator Theorem for Planar Graphs
• A framework for solving VLSI graph layout problems
• A separator theorem for graphs of bounded genus
• Algorithmic Aspects of Vertex Elimination on Graphs
• Algorithmique et calculs de complexité pour un solveur de type dissections emboîtées. (Algorithmic study and complexity bounds for a nested dissection solver)
• Applications of a Planar Separator Theorem
• Calculs de complexité relatifs à une méthode de dissection emboîtée
• Generalized Nested Dissection
• Nested Dissection of a Regular Finite Element Mesh
• On the Problem of Partitioning Planar Graphs
• The analysis of a nested dissection algorithm

Cited in

(6)

• Algorithmique et calculs de complexité pour un solveur de type dissections emboîtées. (Algorithmic study and complexity bounds for a nested dissection solver)
• scientific article; zbMATH DE number 4074330 (Why is no real title available?)
• Quotient tree partitioning of undirected graphs
• Building graph separators with the recursive rotation algorithm for the nested dissection method
• scientific article; zbMATH DE number 3843059 (Why is no real title available?)
• Representations of graphs and networks (coding, layouts and embeddings)

This page was built for publication: Étude de la séparation et de l'élimination sur une famille de graphes quotients déduite d'une méthode de dissections emboîtées

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