Algorithms for Maximum Independent Set in Convex Bipartite Graphs

Authors:
José Soares;Marco A. Stefanes
Affiliations:
Universidade de São Paulo, Instituto de Matemática e Estatística, Rua do Matão 1010, 05508-900, São Paulo, SP, Brazil;Universidade Federal de Mato Grosso do Sul, Departamento de Computação e Estatística, Campo Grande, Brazil
Venue:
Algorithmica
Year:
2009

Citing 0
Cited 1

Finding maximum edge bicliques in convex bipartite graphs

COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper deals with compact label-based representations for trees. Consider an n-node undirected connected graph G with a predefined numbering on the ports of each node. The all-ports tree labeling ℒall ...