We present an algorithm to compute, in O m q n log n time, a maximum clique Ž . in circular-arc graphs with n vertices and m edges provided a circular-arc model of the graph is given. If the circular-arc endpoints are given in sorted order, the Ž . time complexity is O m . The algorithm operates on
A Note on the Riemann Problem for General n × n Conservation Laws
✍ Scribed by Fabio Ancona; Andrea Marson
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 119 KB
- Volume
- 260
- Category
- Article
- ISSN
- 0022-247X
No coin nor oath required. For personal study only.
✦ Synopsis
We analyze the structure of the general solution of the Riemann problem for a strictly hyperbolic system of conservation laws whose characteristic fields are neither genuinely non-linear nor linearly degenerate in the sense of Lax.
📜 SIMILAR VOLUMES
The complex orthogonal group O n acts on the n × n matrices, M n , by restricting the adjoint action of GL n . This action provides us with an action on the ring of complex valued polynomial functions on the n × n matrices, M n . The polynomials of degree d, denoted d M n , form a finite dimensiona
In a recent paper we solved the Bernstein problem in the nonregular nonexcep-Ž . tional case for the type 3, 2 . The aim of this paper it is to describe explicitly all simplicial stochastic nonexceptional nonregular nonnuclear Bernstein algebras of Ž . type n y 2, 2 . According to the Lyubich conjec
In this paper, a technique for the concrete construction of compactly supported 2 Ž n . biorthogonal wavelet bases of L R is given. This technique does not depend on the dimension n, and it gives rise to non-separable multidimensional wavelet bases. Of special interest is the study of the stability
Let f (x, y) be a polynomial with rational coefficients, and let E be a number field. We prove estimates for the number of positive integers n T such that some root : of f (n, y)=0 satisfies E/Q(:). The estimates are uniform with respect to E and, provided E satisfies natural necessary conditions, t