Results 51 to 60 of about 1,841,497 (380)

Heuristic Search for the Analysis of Graph Transition Systems [PDF]

, 2006
Graphs are suitable modeling formalisms for software and hardware systems involving aspects such as communication, object orientation, concurrency, mobility and distribution.
Lluch-Lafuente, Alberto, Jabbar, Shahid, Edelkamp, Stefan, Alberto Lluch Lafuente, Shahid Jabbar, Stefan Edelkamp   +5 more
core   +1 more source

Graph-based implicit knowledge discovery from architecture change logs [PDF]

, 2012
Service architectures continuously evolve as a consequence of frequent business and technical change cycles. Architecture change log data represents a source of evolution-centric information in terms of intent, scope and operationalisation to ...
Pooyan Jamshidi (5276344), Aakash, Ahmad, Aakash Ahmad, Ahmad, Aakash, Claus Pahl (12588787), Pahl, Claus, Muteer Arshad, Jamshidi, Pooyan, Pooyan Jamshidi, Arshad, Muteer, Claus Pahl, Muteer Arshad (12620287), Aakash Ahmad (5022314)   +12 more
core   +1 more source

Graph Algorithm Animation with Grrr [PDF]

, 2000
We discuss geometric positioning, highlighting of visited nodes and user defined highlighting that form the algorithm animation facilities in the Grrr graph rewriting programming language. The main purpose of animation was initially for the debugging and
Peter J. Rodgers, Rodgers, Peter, Vidal, Natalia, Natalia Vidal   +3 more
core   +1 more source

Graph Theory and Mean Shift Segmentation Based Classification of Building Facades [PDF]

, 2011
Automatic classification of building facades has become a field of interest for researchers, since it can provide important solutions to many remote sensing research field.
Sirmacek, Beril, Beril Sirmacek
core   +1 more source

Bond graph analysis in robust engineering design [PDF]

, 2000
Within engineering design, optimization often involves building models of working systems to improve design objectives such as performance, reliability and cost.
GABBRIELLI R., de Mast, J., Does, R.J.M.M., BRAGLIA, MARCELLO, van den Heuvel, E.R., BRAGLIA M., Heuvel, van den, E.R., Bates, RA, YANG, Zhenlin, BEVILACQUA M., Atherton, MA, GABBRIELLI, ROBERTO, Bates, R. A., Yang, Z., Schippers, W.A.J., Atherton, M. A., Mast, de, J., Does, R.J.M.M.; id_orcid, BEVILACQUA, MAURIZIO, Wu, Shuo-jye; Tsai, Tzong-ru, Xie, M., Gaudoin, O., Wu, Shuo-jye   +22 more
core   +1 more source

Generalized Contingency Analysis Based on Graph Theory and Line Outage Distribution Factor [PDF]

IEEE Systems Journal, 2020
Identifying the multiple critical components in power systems whose absence together has severe impact on system performance is a crucial problem for power systems known as $(N-x)$ contingency analysis. However, the inherent combinatorial feature of the $
M. Narimani, Hao Huang, A. Umunnakwe, Zeyu Mao, Abhijeet Sahu, S. Zonouz, K. Davis   +6 more
semanticscholar   +1 more source

Structural Analysis of Nanoscale Network Materials Using Graph Theory.

ACS Nano, 2021
Many materials with remarkable properties are structured as percolating nanoscale networks (PNNs). The design of this rapidly expanding family of composites and nanoporous materials requires a unifying approach for their structural description.
D. Vecchio, Samuel H Mahler, M. Hammig, N. Kotov   +3 more
semanticscholar   +1 more source

Geary’s c and Spectral Graph Theory

Mathematics, 2021
Spatial autocorrelation, of which Geary’s c has traditionally been a popular measure, is fundamental to spatial science. This paper provides a new perspective on Geary’s c.
Hiroshi Yamada
doaj   +1 more source

Maximal Planar Graph Theory and the Four-Color Conjecture [PDF]

This open access book integrates foundational principles with advanced methodologies concerning maximal planar graphs. It offers readers an exceptional examination of graph structures, chromatic polynomials, and the construction and proof techniques of ...
Xu, Jin
core   +1 more source

Capturing Topology in Graph Pattern Matching [PDF]

, 2011
Graph pattern matching is often defined in terms of subgraph isomorphism, an np-complete problem. To lower its complexity, various extensions of graph simulation have been considered instead.
Huai, Jinpeng, Cao, Yang; id_orcid, Wo, Tianyu, Ma, Shuai, Yang Cao, Fan, Wenfei; id_orcid, Tianyu Wo, Shuai Ma, Jinpeng Huai, Wenfei Fan   +9 more
core   +1 more source