Results 231 to 240 of about 107,276 (264)

Tree-Matchings in Graph Processes

SIAM Journal on Discrete Mathematics, 1991
The authors consider the hitting times of nonmonotone graph properties involving tree matchings in a random graph process. They extend the results of \textit{B. Bollobás} and \textit{A. M. Frieze} [On matchings and Hamiltonian cycles in random graphs, Random graphs '83, Lect. 1st Semin., Poznań/Pol. 1983, Ann. Discrete Math.
Łuczak, Tomasz, Ruciński, Andrzej
openaire   +1 more source

Graphs and Trees

2012
This chapter introduces graphs as diagrams for solving puzzles. Careful definitions specify the language of graph theory: vertices, edges, degrees, paths, circuits, Euler paths, Hamilton paths, and so on. Then our interest returns to trees, with algorithms for depth-first traversal and for breadth-first traversal.
Tom Jenkyns, Ben Stephenson
openaire   +1 more source

REACHABILITY ON SUFFIX TREE GRAPHS

International Journal of Foundations of Computer Science, 2008
We analyze the complexity of graph reachability queries on ST-graphs, defined as directed acyclic graphs (DAGs) obtained by merging the suffix tree of a given string and its suffix links. Using a simplified reachability labeling algorithm presented by Agrawal et al. (1989), we show that for a random string of length n, its ST-graph can be preprocessed
Higa, Yasuto, Bannai, Hideo, Inenaga, Shunsuke, Takeda, Masayuki   +3 more
openaire   +2 more sources

On tree graphs of directed graphs

IEEE Transactions on Circuit Theory, 1972
A method is presented for the construction of a directed graph whose directed tree graph is an open-edge train of n edges.
V. Rao, N. Raju
openaire   +1 more source

Trees and Graphs

1987
A travelling salesman lives in Doncaster and has to visit Aberdeen, Bradford and Cardiff. If he knows the distances between each of the four towns, what is the shortest route which ensures that he visits each town once only and ends up at his starting point? Figure 20.1. shows the distances between the towns.
openaire   +1 more source

Hybrid trees and hybrid tree graphs

IEEE Transactions on Circuits and Systems, 1975
A subgraph "a hybrid tree" in a linear graph G which has properties of both a tree and a cotree is defined. In the definition, the set E of edges of G is partitioned into two subsets. The relations between the number of edges of a hybrid tree and the partition of E are discussed. Furthermore, a hybrid tree graph which is a generalized concept of a tree
openaire   +1 more source

Trees and unicyclic graphs with hamiltonian path graphs

Journal of Graph Theory, 1990
AbstractWe prove two conjectures of Broersma and Hoede about path graphs of trees and unicyclic graphs.
openaire   +1 more source

Combining graph-cut clustering with object-based stem detection for tree segmentation in highly dense airborne lidar point clouds

ISPRS Journal of Photogrammetry and Remote Sensing, 2021
Sebastian Dersch, Marco Heurich, Peter Krzystek   +2 more
exaly  

A tree-structure-guided graph convolutional network with contrastive learning for the assessment of parkinsonian hand movements

Medical Image Analysis, 2022
Rui Guo, Hao Li, Xiaohua Qian
exaly  

A Graph Neural Network Assisted Monte Carlo Tree Search Approach to Traveling Salesman Problem

IEEE Access, 2020
Zhihao Xing, Shikui Tu
exaly