𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On a generalization of the Gallai–Roy–Vitaver theorem to the bandwidth coloring problem

✍ Scribed by Bernard Gendron; Alain Hertz; Patrick St-Louis

Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
239 KB
Volume
36
Category
Article
ISSN
0167-6377

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.

A General Formulation of Discrete-Time Q
A General Formulation of Discrete-Time Quantum Mechanics: Restrictions on the Action and the Relation of Unitarity to the Existence Theorem for Initial-Value Problems
✍ M. Khorrami 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 350 KB 👁 1 views

A general formulation for discrete-time quantum mechanics, based on Feynman's method in ordinary quantum mechanics, is presented. It is shown that the ambiguities present in ordinary quantum mechanics (due to noncommutativity of the operators), are no longer present here. Then the criteria for the u