Approximating Maximum Leaf Spanning Trees in Almost Linear Time-Reference-Cited by-同舟云学术

Approximating Maximum Leaf Spanning Trees in Almost Linear Time

Published:1998-10 Issue:1 Volume:29 Page:132-141
ISSN:0196-6774
Container-title:Journal of Algorithms
language:en
Short-container-title:Journal of Algorithms

Author:

Lu Hsueh-I,Ravi R

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Computational Mathematics,Control and Optimization

Reference14 articles.

1. Proof verification and the hardness of approximation problems;Arora,1992

2. Probabilistic checking of proofs: A new characterization of NP;Arora,1992

3. On linear time minor tests and depth first search;Bodlaender,1989

4. Self-stabilizing systems in spite of distributed control;Dijkstra;Comm. ACM,1974

5. M. R. Fellows, M. A. Langston, On Well-Partial-Order Theory and Its Applications to Combinatorial Problems of VLSI Design, CS-88-188, Dept. of Computer Science, Washington State University, 1988

Cited by 74 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Full degree spanning trees in random regular graphs;Discrete Applied Mathematics;2024-08

2. Mapping the spatial organisation of air transport network by WENA-MLST analysis;Transportmetrica A: Transport Science;2023-09-22

3. A Simple 2-Approximation for Maximum-Leaf Spanning Tree;International Journal of Foundations of Computer Science;2023-05-29

4. Online Learning of Convex Sets on Graphs;Machine Learning and Knowledge Discovery in Databases;2023

5. A new formulation and algorithm for the maximum leaf spanning tree problem with an application in forest fire detection;Engineering Optimization;2022-06-15