A Numerical Approach to Long Cycles in Graphs and Digraphs.
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F01%3A06010010" target="_blank" >RIV/67985807:_____/01:06010010 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
A Numerical Approach to Long Cycles in Graphs and Digraphs.
Original language description
We present a simple numerical method for computing the minimal negativity over all cycles in an ordered digraph. Minimizing over all orderings leads then to the maximal cycle in the digraph.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GA201%2F98%2F0222" target="_blank" >GA201/98/0222: Linear algebra and its applications to optimization problems with inexact data</a><br>
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2001
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Discrete Mathematics
ISSN
0012-365X
e-ISSN
—
Volume of the periodical
235
Issue of the periodical within the volume
N/A
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
4
Pages from-to
233-236
UT code for WoS article
—
EID of the result in the Scopus database
—