Results 1 to 10 of about 100,358 (126)
Oriented Flip Graphs and Noncrossing Tree Partitions [PDF]
Given a tree embedded in a disk, we define two lattices - the oriented flip graph of noncrossing arcs and the lattice of noncrossing tree partitions.
Alexander Garver, Thomas McConville
doaj +6 more sources
Oriented Flip Graphs of Polygonal Subdivisions and Noncrossing Tree Partitions
Given a tree embedded in a disk, we introduce a simplicial complex of noncrossing geodesics supported by the tree, which we call the noncrossing complex. The facets of the noncrossing complex have the structure of an oriented flip graph. Special cases of
Thomas McConville, Alexander Garver
exaly +5 more sources
Within the domain of robotic non-destructive testing (NDT) of complex structures, the existing methods typically utilise an offline robot-path-planning strategy. Commonly, for robotic inspection, this will involve full coverage of the component.
Mengyuan Zhang +3 more
doaj +2 more sources
Querying Object-Oriented Databases Based on Signature Graph and n-ary Tree [PDF]
In this paper, we suggest a new technique to create index helping for querying almost identical similarities with keywords in case there is no correct match found.
Tran Minh Bao +2 more
doaj +3 more sources
Task-oriented scene data in big data and cloud environments of a smart city that must be time-critically processed are dynamic and associated with increasing complexities and heterogeneities. Existing hybrid tree-based external indexing methods are input/
Bin Feng +9 more
doaj +2 more sources
Trees Contained in Every Orientation of a Graph
For every graph $G$, let $t(G)$ denote the largest integer $t$ such that every oriented tree of order $t$ appears in every orientation of $G$. In 1980, Burr conjectured that $t(G)\geq 1+\chi(G)/2$ for all $G$, and showed that $t(G)\geq 1+ \lfloor\sqrt ...
Tássio Naia
semanticscholar +2 more sources
Aspect-level sentiment classification (ALSC) is a fine-grained sentiment analysis task that aims to predict the sentiment of the given aspect in a sentence. Recent studies mainly focus on using the Graph Convolutional Networks (GCN) to deal with both the
Jiehai Chen +4 more
doaj +2 more sources
Nonseparating Trees in 2-Connected Graphs and Oriented Trees in Strongly Connected Digraphs [PDF]
Mader [J. Graph Theory 65 (2010) 61-69] conjectured that for every positive integer $k$ and every finite tree $T$ with order $m$, every $k$-connected, finite graph $G$ with $δ(G)\geq \lfloor\frac{3}{2}k\rfloor+m-1$ contains a subtree $T'$ isomorphic to $T$ such that $G-V(T')$ is $k$-connected. The conjecture has been verified for paths, trees when $k=1$
Hong-Jian Lai, Yingzhi Tian, Liqiong Xu
exaly +4 more sources
Spectra of Some Interesting Combinatorial Matrices Related to Oriented Spanning Trees on a Directed Graph [PDF]
For a digraph \(G\) let \(D(G)\) be the digraph whose vertices are all oriented rooted spanning trees of \(G\) with arcs connecting vertices corresponding to oriented rooted spanning trees which can be obtained one from the other by a local transformation defined in the paper.
Christos A. Athanasiadis
exaly +6 more sources
Requirements for an extensible object-oriented tree/graph editor
Software engineers use graphs to represent many types of information. This paper describes a tool which is used to rapidly extend base classes to create graph editors as a user-interface to these information domains. This paper also presents requirements
A. Karrer, W. Scacchi
semanticscholar +3 more sources

