On-line arbitrarily vertex decomposable trees (original) (raw)

Algorithmic Necropolitics

Tarcizio Silva

Sexualidad, Salud y Sociedad, 2022

View PDFchevron_right

Free PDF

Algorithmic Necropolitics Cover Page

Uniform tree lattices

Ravindra Kulkarni

Journal of the American Mathematical Society, 1990

View PDFchevron_right

Free PDF

Uniform tree lattices Cover Page

Laplacian energy of trees with at most 10 vertices

Tayyab Kamran

Indonesian journal of combinatorics, 2018

View PDFchevron_right

Free PDF

Laplacian energy of trees with at most 10 vertices Cover Page

Tree flows through hierarchical slits and orifices

Hamad Almahmoud

International Communications in Heat and Mass Transfer, 2021

View PDFchevron_right

Free PDF

Tree flows through hierarchical slits and orifices Cover Page

<title>Quasilinear algorithm for the component tree</title&gt

Laurent Najman

Proceedings of SPIE, 2004

View PDFchevron_right

Free PDF

<title>Quasilinear algorithm for the component tree</title&gt Cover Page

Optimal skeleton and reduced Huffman trees

Shmuel Tomi Klein

Theoretical Computer Science, 2021

View PDFchevron_right

Free PDF

Optimal skeleton and reduced Huffman trees Cover Page

The ally-reconstruction number of a tree with five or more vertices is three

Wendy Myrvold

Journal of Graph Theory, 1990

View PDFchevron_right

Free PDF

The ally-reconstruction number of a tree with five or more vertices is three Cover Page

Reachability Results in Plane Trees

Isaac Owino Okoth, Albert Oloo

Communications in Advanced Mathematical Sciences, 2021

View PDFchevron_right

Free PDF

Reachability Results in Plane Trees Cover Page

Two new classes of trees embeddable into hypercubes

Mounira Nekri

RAIRO - Operations Research, 2004

View PDFchevron_right

Free PDF

Two new classes of trees embeddable into hypercubes Cover Page

The geometry of unfolding tree leaves

B. Kresling

Proceedings of the Royal Society B: Biological Sciences, 1998

View PDFchevron_right

Free PDF

The geometry of unfolding tree leaves Cover Page

Extracting whole short rotation trees with a skidder and a front-end loader

B. Hartsough

Biomass and Bioenergy, 2001

View PDFchevron_right

Free PDF

Extracting whole short rotation trees with a skidder and a front-end loader Cover Page

The Testimony of Trees

Henrik Gustafsson

Crime Scenery in Postwar Film and Photography

View PDFchevron_right

Free PDF

The Testimony of Trees Cover Page

Co-divergence and tree topology

Tiziana Calamoneri

Journal of Mathematical Biology, 2019

View PDFchevron_right

Free PDF

Co-divergence and tree topology Cover Page

PDL for ordered trees

Patrick Blackburn

Journal of Applied Non-Classical Logics, 2005

View PDFchevron_right

Free PDF

PDL for ordered trees Cover Page

K-regular decomposable incidence structure of maximum degree

Dario Galic

Mathematica Moravica, 2022

View PDFchevron_right

Free PDF

K-regular decomposable incidence structure of maximum degree Cover Page

On the Steiner median of a tree

Ortrud Oellermann

Discrete Applied Mathematics, 1996

View PDFchevron_right

Free PDF

On the Steiner median of a tree Cover Page

Decompositions of highly connected graphs into paths of length 3

Yoshiko Wakabayashi

Journal of Graph Theory, 2008

View PDFchevron_right

Free PDF

Decompositions of highly connected graphs into paths of length 3 Cover Page

Non-uniform lattices on uniform trees

Alexander Lubotzky

Memoirs of the American Mathematical Society, 2001

View PDFchevron_right

Free PDF

Non-uniform lattices on uniform trees Cover Page

The generic graph component library

Lie-Quan Lee

1999

View PDFchevron_right

Free PDF

The generic graph component library Cover Page

K-D Trees Are Better when Cut on the Longest Side

Matthew Dickerson

Algorithms - ESA 2000, 2000

View PDFchevron_right

Free PDF

K-D Trees Are Better when Cut on the Longest Side Cover Page

{0,2}-Degree free spanning forests in graphs

Siamak Sabour

Discrete Mathematics, 2015

View PDFchevron_right

Free PDF

{0,2}-Degree free spanning forests in graphs Cover Page

Point-set embeddings of trees with given partial drawings

Walter Didimo

Computational Geometry, 2009

View PDFchevron_right

Free PDF

Point-set embeddings of trees with given partial drawings Cover Page

Parallel processing of large graphs

Tomasz Kajdanowicz

Future Generation Computer Systems, 2014

View PDFchevron_right

Free PDF

Parallel processing of large graphs Cover Page

Spanning hypertrees, vertex tours and meanders

Robert Cori

arXiv (Cornell University), 2021

View PDFchevron_right

Free PDF

Spanning hypertrees, vertex tours and meanders Cover Page

An algebraic theory of graph reduction

Stefan Arnborg

Journal of the ACM, 1993

View PDFchevron_right

Free PDF

An algebraic theory of graph reduction Cover Page