Tree spanners for bipartite graphs and probe interval graphs
type: Item
instance of: scholarly article
title: Tree spanners for bipartite graphs and probe interval graphs
zbMATH Open document ID: 1107.68062
author: Feodor F. Dragan
author: Hoàng-Oanh Le
author: Van Bang Le
author: Ryuhei Uehara
author: Andreas Brandstädt
published in: Algorithmica
publication date: 2007-03-05T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 5131054
MaRDI profile type: Publication
full work available at URL: s00453-006-1209-y
OpenAlex ID: W2045824107
DOI: 10.1007/S00453-006-1209-Y
Recommended article: Graph-Theoretic Concepts in Computer Science
Recommended article: Spanners for bounded tree-length graphs
Recommended article: Q3004302
Recommended article: Q3088444
Recommended article: Tree spanners of bounded degree graphs
Recommended article: Spanning \(k\)-trees of bipartite graphs
Recommended article: Tree 3-spanners on interval, permutation and regular bipartite graphs
Recommended article: Tree spanners on chordal graphs: complexity and algorithms
Recommended article: Tree spanners in planar graphs
description: scientific article; zbMATH DE number 5131054