The disjoint cliques problem
Klaus Jansen, Petra Scheffler, Gerhard Woeginger (1997)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Displaying similar documents to “Applications of mathematical programming in graceful labeling of graphs.”
The disjoint cliques problem
Challenging complexity of maximum common subgraph detection algorithms: A performance analysis of three algorithms on a wide database of graphs.
Conte, Donatello, Foggia, Pasquale, Vento, Mario (2007)
Journal of Graph Algorithms and Applications
Similarity:
On polynomial time decidability of induced-minor-closed classes
Jiří Matoušek, Jaroslav Nešetřil, Robin D. Thomas (1988)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
Experiments with the fixed-parameter approach for two-layer planarization.
Suderman, Matthew, Whitesides, Sue (2005)
Journal of Graph Algorithms and Applications
Similarity:
On the number of labeled -arch graphs.
Caminiti, Saverio, Fusco, Emanuele G. (2007)
Journal of Integer Sequences [electronic only]
Similarity:
Minimum convex-cost tension problems on series-parallel graphs
Bruno Bachelet, Philippe Mahey (2003)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
We present briefly some results we obtained with known methods to solve minimum cost tension problems, comparing their performance on non-specific graphs and on series-parallel graphs. These graphs are shown to be of interest to approximate many tension problems, like synchronization in hypermedia documents. We propose a new aggregation method to solve the minimum convex piecewise linear cost tension problem on series-parallel graphs in operations.
Computing and drawing isomorphic subgraphs.
Bachl, S., Brandenburg, F.-J., Gmach, D. (2004)
Journal of Graph Algorithms and Applications
Similarity:
A note on the computational complexity of computing the edge rotation distance between graphs
Mirko Křivánek (1988)
Časopis pro pěstování matematiky
Similarity: