Pages that link to "Item:Q4305040"

The following pages link to Node and element resequencing using the Laplacian of a finite element graph: Part I—General concepts and algorithm (Q4305040):

Displayed 10 items.

• A bandwidth reduction algorithm for L-shaped and Z-shaped grid structured graphs (Q408436) ‎ (← links)
• Combinatorial optimization of special graphs for nodal ordering and graph partitioning (Q731499) ‎ (← links)
• Two improved algorithms for envelope and wavefront reduction (Q1371664) ‎ (← links)
• A novel nodal ordering algorithm for profile optimization by efficient solution of a differential equation (Q3055861) ‎ (← links)
• (Q3122350) ‎ (← links)
• Polygonal finite elements for topology optimization: A unifying paradigm (Q3567292) ‎ (← links)
• A new algorithm for finding a pseudoperipheral vertex or the endpoints of a pseudodiameter in a graph (Q4315432) ‎ (← links)
• (Q4355305) ‎ (← links)
• (Q4495457) ‎ (← links)
• Topology and graph products; eigenproblems in optimal structural analysis (Q5302246) ‎ (← links)