On the parallel complexity of the alternating hamiltonian cycle problem
E. Bampis, Y. Manoussakis, I. Milis (1999)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Displaying similar documents to “Minimum cut in directed planar networks”
On the parallel complexity of the alternating hamiltonian cycle problem
A linear algorithm for bend-optimal orthogonal drawings of triconnected cubic plane graphs.
Rahman, Md.Saidur, Nakano, Shin-ichi, Nishizeki, Takao (1999)
Journal of Graph Algorithms and Applications
Similarity:
Decomposing complete equipartite graphs into short odd cycles.
Smith, Benjamin R., Cavenagh, Nicholas J. (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On -Pancyclic Graphs
Vasil Jacoš (1975)
Matematický časopis
Similarity:
Labeled shortest paths in digraphs with negative and positive edge weights
Phillip G. Bradford, David A. Thomas (2009)
RAIRO - Theoretical Informatics and Applications
Similarity:
This paper gives a shortest path algorithm for CFG (context free grammar) labeled and weighted digraphs where edge weights may be positive or negative, but negative-weight cycles are not allowed in the underlying unlabeled graph. These results build directly on an algorithm of Barrett [ (2000) 809–837]. In addition to many other results, they gave a shortest path algorithm for CFG labeled and weighted digraphs where all edges are nonnegative. Our algorithm is based...
Bent Hamilton cycles in -dimensional grid graphs.
Ruskey, F., Sawada, Joe (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Geodetic topological cycles in locally finite graphs.
Georgakopoulos, Agelos, Sprussel, Philipp (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A Linear Time Algorithm for Computing Longest Paths in Cactus Graphs
Markov, Minko, Ionut Andreica, Mugurel, Manev, Krassimir, Tapus, Nicolae (2012)
Serdica Journal of Computing
Similarity:
ACM Computing Classification System (1998): G.2.2. We propose an algorithm that computes the length of a longest path in a cactus graph. Our algorithm can easily be modified to output a longest path as well or to solve the problem on cacti with edge or vertex weights. The algorithm works on rooted cacti and assigns to each vertex a two-number label, the first number being the desired parameter of the subcactus rooted at that vertex. The algorithm applies the divide-and-conquer...