Results 71 to 80 of about 100 (100)

Spanning Star Trees In Regular Graphs

For a subset W of vertices of an undirected graph G, let S(W ) be the subgraph consisting of W , all edges incident to at least one vertex in W , and all vertices adjacent to at least one vertex in W . If S(W ) is a tree containing all the vertices of G,
Jerrold W. Grossman
core  

Vector Encoding of Phylogenetic Trees by Ordered Leaf Attachment. [PDF]

Bull Math Biol
Richman DH, Zhang C, Matsen FA.
europepmc   +1 more source

New algorithms for maximum disjoint paths based on tree-likeness. [PDF]

Math Program, 2018
Fleszar K, Mnich M, Spoerhase J.
europepmc   +1 more source

An FPTAS for Connectivity Interdiction. [PDF]

Math Program
Huang CC, Obscura Acosta N, Yingchareonthawornchai S.   +2 more
europepmc   +1 more source

FR3D: finding local and composite recurrent structural motifs in RNA 3D structures. [PDF]

J Math Biol, 2008
Sarver M, Zirbel CL, Stombaugh J, Mokdad A, Leontis NB.   +4 more
europepmc   +1 more source

Arboreal networks and their underlying trees. [PDF]

J Math Biol
Huber KT, Overman D.
europepmc   +1 more source

Quantifying the difference between phylogenetic diversity and diversity indices. [PDF]

J Math Biol
Bordewich M, Semple C.
europepmc   +1 more source

Crossover operators for molecular graphs with an application to virtual drug screening. [PDF]

J Cheminform
Domschke N, Schmidt BJ, Gatter T, Golnik R, Eisenhuth P, Liessmann F, Meiler J, Stadler PF.   +7 more
europepmc   +1 more source

Better-than- 4 3 -approximations for leaf-to-leaf tree and connectivity augmentation. [PDF]

Math Program
Cecchetto F, Traub V, Zenklusen R.
europepmc   +1 more source

Diverse collections in matroids and graphs. [PDF]

Math Program
Fomin FV, Golovach PA, Panolan F, Philip G, Saurabh S.   +4 more
europepmc   +1 more source