Worst-case relative performances of heuristics for the Steiner problem in graphs.
Plesník, Ján (1991)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
Plesník, Ján (1991)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
Zsakó, László (2006)
Annales Mathematicae et Informaticae
Similarity:
Auber, David, Delest, Maylis, Domenger, Jean-Philippe, Dulucq, Serge (2006)
Journal of Graph Algorithms and Applications
Similarity:
Mirko Vujošević, Milan Stanojević (2003)
The Yugoslav Journal of Operations Research
Similarity:
Schulze, Bernd (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Mészáros, Karola (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Duncan, Christian A., Goodrich, Michael T., Kobourov, Stephen G. (2000)
Journal of Graph Algorithms and Applications
Similarity:
Zoran Stanić (2006)
Publications de l'Institut Mathématique
Similarity:
Mounira Nekri, Abdelhafid Berrachedi (2004)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
The problem of embedding graphs into other graphs is much studied in the graph theory. In fact, much effort has been devoted to determining the conditions under which a graph G is a subgraph of a graph H, having a particular structure. An important class to study is the set of graphs which are embeddable into a hypercube. This importance results from the remarkable properties of the hypercube and its use in several domains, such as: the coding theory, transfer of information, multicriteria...
Grünewald, Stefan, Humphries, Peter J., Semple, Charles (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Kenyon, Richard W., Propp, James G., Wilson, David B. (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Chen, William Y.C., Yan, Sherry H.F. (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Vassilev, Tzvetalin, Ammerlaan, Joanna (2013)
Serdica Journal of Computing
Similarity:
ACM Computing Classification System (1998): G.2.2, F.2.2. Recently, Markov, Vassilev and Manev [2] proposed an algorithm for finding the longest path in 2-trees. In this paper, we describe an implementation of the algorithm. We briefly discuss the algorithm and present example that helps the reader grasp the main algorithmic ideas. Further, we discuss the important stages in the implementation of the algorithm and justify the decisions taken. Then, we present experimental...