Triangle graphs
From MaRDI portal
Publication:1893541
DOI10.1016/0168-9274(95)00011-IzbMath0827.05022OpenAlexW2911277148MaRDI QIDQ1893541
Messaoud Benantar, Ugur Dogrusoz, Mukkai S. Krishnamoorthy, Joseph E. Flaherty
Publication date: 27 November 1995
Published in: Applied Numerical Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0168-9274(95)00011-i
Applications of graph theory (05C90) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Unnamed Item
- Unnamed Item
- High-order adaptive methods for parabolic systems
- Parallel computation with adaptive methods for elliptic and hyperbolic systems
- Planar graphs: Theory and algorithms
- Parallel concepts in graph theory
- A four-colour parallel algorithm for the solution of a two-dimensional advection-diffusion equation with the finite element method
- An expert system for the optimal mesh design in thehp-version of the finite element method
- An Unconventional Domain Decomposition Method for an Efficient Parallel Solution of Large-Scale Finite Element Systems
- The finite element solution of elliptical systems on a data parallel computer
- Automatic three‐dimensional mesh generation by the finite octree technique
- A Large scale finite element analysis using domain decomposition method on a parallel computer
- Robust, geometrically based, automatic two‐dimensional mesh generation
This page was built for publication: Triangle graphs
