Decomposable trees: a polynomial algorithm for tripodes-Reference-Cited by-同舟云学术

Decomposable trees: a polynomial algorithm for tripodes

Published:2002-07 Issue:3 Volume:119 Page:205-216
ISSN:0166-218X
Container-title:Discrete Applied Mathematics
language:en
Short-container-title:Discrete Applied Mathematics

Author:

Barth D.,Baudon O.,Puech J.

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference13 articles.

1. R.H. Arpaci, D.A. Patterson, The interaction of parallel and sequential workloads on a network of workstations, UC Berkeley Technical Report CS-94-830, 1994.

2. B. Awerbuch, A. Goldberg, M. Luby, S. Plotkin, Network decomposition and locality in distributed computing, in Proceedings of the 30th IEEE Symposium on Foundation On Computer Science, May 1989.

3. B. Awerbuch, D. Peleg, Sparse partitions, Proceedings of the 31st IEEE Symposium on Foundations of Computer Science, 1990, pp. 503–513.

4. D. Barth, O. Baudon, J. Puech, Networks sharing: a polynomial algorithm for tripodes, internal report no. 1164, L.R.I, Université de Paris-Sud, 1998.

5. Graphes et Hypergraphes;Berge,1971

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

1. Interplays between variations of arbitrarily partitionable graphs under minimality constraints;Applied Mathematics and Computation;2024-08

2. Small dense on-line arbitrarily partitionable graphs;Applied Mathematics and Computation;2024-06

3. A \sigma₃ condition for arbitrarily partitionable graphs;Discussiones Mathematicae Graph Theory;2022

4. More aspects of arbitrarily partitionable graphs;Discussiones Mathematicae Graph Theory;2020

5. Arbitraly partitionable {;2K_2,C_4}-free graphs;Discussiones Mathematicae Graph Theory;2020