𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A bound on the k-gonality of facets of the hypermetric cone and related complexity problems

✍ Scribed by D. Avis; V.P. Grishukhin

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
799 KB
Volume
2
Category
Article
ISSN
0925-7721

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A note on the complexity of longest path
A note on the complexity of longest path problems related to graph coloring
✍ P.M. Pardalos; A. Migdalas πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 194 KB

In this note, we show that some problems related to the length of the longest simple path from a given vertex in a graph are NP-complete. We also discuss an extension to the graph coloring problem.

On the weak solution of the Neumann prob
On the weak solution of the Neumann problem for the 2D Helmholtz equation in a convex cone and Hs regularity
✍ A. E. Merzon; F.-O. Speck; T. J. Villalba-Vega πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 312 KB πŸ‘ 1 views

We extend previous results for the Neumann boundary value problem to the case of boundary data from the space H -1 2 +e (C), 0<e< 1 2 , where C = \*X is the boundary of a two-dimensional cone X with angle b<p. We prove that for these boundary conditions the solution of the Helmholtz equation in X ex