Add to ORKGWe discuss heuristic and structural algorithms to construct long simple paths in the divisor graph D_n and the lcm-graph M_n and prove an inequality concerning the length-functions f(n) and g(n) of longest simple paths in D_n and M_n for certain natural numbers n. A number of examples are worked out in detail. (orig.)Available from TIB Hannover: RO 1945(304) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekSIGLEDEGerman
We study two "above guarantee" versions of the classical Longest Path problem on undirected and dire...
We show how the color-coding method by Alon, Yuster and Zwick, in its version specialized to comput...
We present a transformation from longest paths to shortest paths in sub-classes of directed acyclic ...
It is known that the longest simple path in the divisor graph that uses integers ≤ N is of length N/...
It is known that the longest simple path in the divisor graph that uses integers ≤ N is of length N/...
We consider the problem of finding a long, simple path in an undirected graph. We present a polynomi...
We consider the problem of finding a long, simple path in an undirected graph. We present a polynomi...
We consider the problem of nding a long, simple path in anundirected graph.W e present a polynomial-...
Abstract. We consider the problem of nding a long, simple path in an undirected graph. We present a ...
We investigate the computational hardness of approximating the longest path and the longest cycle in...
AbstractIn this note, we show that some problems related to the length of the longest simple path fr...
The longest path problem is the one that finds a longest path in a given graph. While the graph clas...
Given a graph G, the longest path problem asks to compute a simple path of G with the largest number...
We consider in this paper the problems of finding the elementary shortest and longest paths on a gra...
The longest simple path and snake-in-a-box are combinatorial search problems of considerable researc...
We study two "above guarantee" versions of the classical Longest Path problem on undirected and dire...
We show how the color-coding method by Alon, Yuster and Zwick, in its version specialized to comput...
We present a transformation from longest paths to shortest paths in sub-classes of directed acyclic ...
It is known that the longest simple path in the divisor graph that uses integers ≤ N is of length N/...
It is known that the longest simple path in the divisor graph that uses integers ≤ N is of length N/...
We consider the problem of finding a long, simple path in an undirected graph. We present a polynomi...
We consider the problem of finding a long, simple path in an undirected graph. We present a polynomi...
We consider the problem of nding a long, simple path in anundirected graph.W e present a polynomial-...
Abstract. We consider the problem of nding a long, simple path in an undirected graph. We present a ...
We investigate the computational hardness of approximating the longest path and the longest cycle in...
AbstractIn this note, we show that some problems related to the length of the longest simple path fr...
The longest path problem is the one that finds a longest path in a given graph. While the graph clas...
Given a graph G, the longest path problem asks to compute a simple path of G with the largest number...
We consider in this paper the problems of finding the elementary shortest and longest paths on a gra...
The longest simple path and snake-in-a-box are combinatorial search problems of considerable researc...
We study two "above guarantee" versions of the classical Longest Path problem on undirected and dire...
We show how the color-coding method by Alon, Yuster and Zwick, in its version specialized to comput...
We present a transformation from longest paths to shortest paths in sub-classes of directed acyclic ...