Algorithms for cluster busting in anchored graph drawing.
Lyons, Kelly A., Meijer, Henk, Rappaport, David (1998)
Journal of Graph Algorithms and Applications
Stoichev, Stoicho (2007)
Serdica Journal of Computing
The paper has been presented at the International Conference Pioneers of Bulgarian Mathematics, Dedicated to Nikola Obreshkoff and Lubomir Tschakalo ff , Sofia, July, 2006.Two heuristic algorithms (M65 and M52) for finding respectively unitals and maximal arcs in projective planes of order 16 are described. The exact algorithms based on exhaustive search are impractical because of the combinatorial explosion (huge number of combinations to be checked). Algorithms M65 and M52 use unions of orbits...
Papakostas, Achilleas, Tollis, Ioannis G. (1999)
Journal of Graph Algorithms and Applications
Bhosle, Amit M., Gonzalez, Teofilo F. (2004)
Journal of Graph Algorithms and Applications
S. Venkatasubramanian, Kamala Krithivasan, C. Pandu Rangan (1989)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
J. M. Pallo (1993)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Jyrki Katajainen, Olli Nevalainen (1987)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Krassimir Atanassov, B. K. Papadopoulos, A. Syropoulos (2004)
Mathware and Soft Computing
In a recent paper by one of the authors it has been shown that there is a relationship between algebraic structures and labeled transition systems. Indeed, it has been shown that an algebraic structures can be viewed as labeled transition systems, which can also be viewed as multigraphs. In this paper, we extend this work by providing an estimation of the transition possibilities between vertices that are connected with multiarcs.
G. Georgakopoulos, A. Stafylopatis (1993)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Rodica Boliac, Vadim Lozin (2001)
Discussiones Mathematicae Graph Theory
In this paper we propose a structural characterization for a class of bipartite graphs defined by two forbidden induced subgraphs. We show that the obtained characterization leads to polynomial-time algorithms for several problems that are NP-hard in general bipartite graphs.
Kavvadias, Dimitris J., Stavropoulos, Elias C. (2005)
Journal of Graph Algorithms and Applications
Eiglsperger, Markus, Siebenhaller, Martin, Kaufmann, Michael (2005)
Journal of Graph Algorithms and Applications
Shapira, Andrew (1997)
The Electronic Journal of Combinatorics [electronic only]
Honkala, Iiro (2010)
The Electronic Journal of Combinatorics [electronic only]
P. Bertolazzi, M. Lucertini, A. Marchetti Spaccamela (1982)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Panholzer, Alois, Prodinger, Helmut (2004)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Damian Bogdanowicz (2011)
Applicationes Mathematicae
The reconstruction of evolutionary trees is one of the primary objectives in phylogenetics. Such a tree represents historical evolutionary relationships between different species or organisms. Tree comparisons are used for multiple purposes, from unveiling the history of species to deciphering evolutionary associations among organisms and geographical areas. In this paper, we describe a general method for comparing phylogenetic trees and give some basic properties of the Matching Split metric, which...
Schank, Thomas, Wagner, Dorothea (2005)
Journal of Graph Algorithms and Applications
He, G., Liu, J., Zhao, C. (2000)
Journal of Graph Algorithms and Applications
Morgan, Kerri, Farr, Graham (2007)
Journal of Graph Algorithms and Applications