Results 241 to 250 of about 2,664,283 (267)

Enumerating all the spanning trees in an un-oriented graph - A novel approach

2010 XIth International Workshop on Symbolic and Numerical Methods, Modeling and Applications to Circuit Design (SM2ACD), 2010
In this paper, we use a modified version of the incidence matrix of an un-oriented graph so as to enumerate all the spanning trees. In particular, we formally describe the problem and then enumerate the spanning trees, also Showing how to use this method in finding the symbolic determinant of a passive circuit.
Cristian E. Onete, Maria Cristina C. Onete   +1 more
openaire   +1 more source

Verifying Computation Tree Logic of Knowledge via the Similar Reachability Graphs of Knowledge-oriented Petri Nets

2020 39th Chinese Control Conference (CCC), 2020
Computation Tree Logic of Knowledge (CTLK) can specify many requirements of privacy or security of multi-agent systems (MAS). In our previous paper, we defined Knowledge-oriented Petri Nets (KPN) to model MAS. A KPN is a special Petri net in which some places are used to represent knowledge.
Leifeng He, Guanjun Liu
openaire   +1 more source

Linear time algorithms to solve the linear ordering problem for oriented tree based graphs

RAIRO - Operations Research, 2016
Summary: We present in this paper two simple linear algorithms that solve to optimality the linear ordering problem for unweighted tree based graphs \textit{viz}. the oriented trees and the oriented divide-and-conquer graphs.
Alain Quilliot, Djamal Rebaine
openaire   +2 more sources

A Symbolic Circuit Analysis-Oriented Algorithm for Finding a Common Tree of the Current and Voltage Graphs

Analog Integrated Circuits and Signal Processing, 2001
A fundamental problem of symbolic analysis of electric networks when using the signal-flow (SFG) graph method is to find the common tree of the current and voltage graph (G_I and G_V, respectively). In this paper we introduce a novel method in order to determine a common tree of both graphs, which may be used to obtain the symbolic network transfer ...
Arturo Sarmiento-Reyes, Octavio González-Castolo   +1 more
openaire   +1 more source

A symbolic circuit analysis-oriented algorithm for finding a common tree of the current and voltage graphs

Proceedings of the 2000 Third IEEE International Caracas Conference on Devices, Circuits and Systems (Cat. No.00TH8474), 2002
A fundamental problem of symbolic analysis when using the signal flow graph method is to find the common tree of the current and voltage graph (Gi and Gv, respectively), which can be further applied for testing. In this paper we present a novel method in order to determine a common tree of both graphs, which may be used to obtain the symbolic network ...
L.A. Sarmiento-Reyes, L.O. Gonzilez-Castolo, V.H. Champac   +2 more
openaire   +1 more source

Oriented Minimum spanning tree looks like the Uniform spanning tree on the complete graph (at least locally)

44 pages, many ...
Bagchi, Swarnadeep, Ray, Gourab
openaire   +1 more source

Oriented bipartite graphs and the Goldbach graph

Discrete Mathematics, 2021
Shamik Ghosh, Shamik Ghosh, Sandip Das   +2 more
exaly  

Tree++: Truncated Tree Based Graph Kernels

IEEE Transactions on Knowledge and Data Engineering, 2021
Rachel Redberg, Ambuj Singh, Wei Ye
exaly  

Multi-layered tree crown extraction from LiDAR data using graph-based segmentation

Computers and Electronics in Agriculture, 2020
Jing Fan, Tianyang Dong
exaly  

Mutual Learning Between Saliency and Similarity: Image Cosegmentation via Tree Structured Sparsity and Tree Graph Matching

IEEE Transactions on Image Processing, 2018
Shuyuan Yang, Licheng Jiao, Yan Ren
exaly