Characterization of -bar visibility trees.

Chen, Guantao; Hutchinson, Joan P.; Keating, Ken; Shen, Jian

Displaying similar documents to “Characterization of $[1, k]$ -bar visibility trees.”

An algorithmic Friedman-Pippenger theorem on tree embeddings and applications.

Dellamonica, Domingos jun., Kohayakawa, Yoshiharu (2008)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

I/O-optimal algorithms for outerplanar graphs.

Maheshwari, Anil, Zeh, Norbert (2004)

Journal of Graph Algorithms and Applications

Similarity:

Finding dominators in practice.

Georgiadis, Loukas, Tarjan, Robert E., Werneck, Renato F. (2006)

Journal of Graph Algorithms and Applications

Similarity:

Clustering in trees: Optimizing cluster sizes and number of subtrees.

Hambrusch, Susanne E., Liu, Chuan-Ming, Lim, Hyeong-Seok (2000)

Journal of Graph Algorithms and Applications

Similarity:

Approximation algorithms for the maximum induced planar and outerplanar subgraph problems.

Morgan, Kerri, Farr, Graham (2007)

Journal of Graph Algorithms and Applications

Similarity:

The color-balanced spanning tree problem

Štefan Berežný, Vladimír Lacko (2005)

Kybernetika

Similarity:

Suppose a graph $G = (V, E)$ whose edges are partitioned into $p$ disjoint categories (colors) is given. In the color-balanced spanning tree problem a spanning tree is looked for that minimizes the variability in the number of edges from different categories. We show that polynomiality of this problem depends on the number $p$ of categories and present some polynomial algorithm.