Algorithms for cluster busting in anchored graph drawing.
Algorithms for Finding Unitals and Maximal Arcs in Projective Planes of Order 16
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...
Algorithms for incremental orthogonal graph drawing in three dimensions.
Algorithms for single link failure recovery and related problems.
Algorithms for weighted graph problems on the modified cellular graph automaton
An algorithm to compute the möbius function of the rotation lattice of binary trees
An almost naive algorithm for finding relative neighbourhood graphs in metrics
An application of the theory of intuitionistic fuzzy multigraphs.
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.
An approach to parallel algorithm design
An attractive class of bipartite graphs
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.
An efficient algorithm for the transversal hypergraph generation.
An efficient implementation of Sugiyama's algorithm for layered graph drawing.
An exact performance bound for an time greedy matching procedure.
An optimal strongly identifying code in the infinite triangular grid.
Analysis of a class of graph partitioning problems
Analysis of some statistics for increasing tree families.
Analyzing sets of phylogenetic trees using metrics
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...
Approximating clustering coefficient and transitivity.
Approximation algorithms for some graph partitioning problems.
Approximation algorithms for the maximum induced planar and outerplanar subgraph problems.