Abstract
Meshes are a standard support for finding approximate solutions to partial differential equations (PDE) as well as of integral equations. Computational techniques working with a Divide-and-Conquer scheme need an initial mesh to be recursively broken into pieces of comparable size by cutting along small set of points (called a vertex separator).
A solution without a problem is an ill-stated solution.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Nešetřil, J., de Mendez, P.O. (2012). A Few Problems. In: Sparsity. Algorithms and Combinatorics, vol 28. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27875-4_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-27875-4_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-27874-7
Online ISBN: 978-3-642-27875-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)