Results 21 to 30 of about 1,724,695 (249)
The complexity of two graph orientation problems [PDF]
, 2012 This is the post-print version of the Article. The official published version can be accessed from the link below - Copyright @ 2012 ElsevierWe consider two orientation problems in a graph, namely the minimization of the sum of all the shortest path ...
Noble, Steven D. +7 more
core +1 more source
Understanding object-oriented source code from the behavioural perspective [PDF]
, 2005 Comprehension is a key activity that underpins a variety of software maintenance and engineering tasks. The task of understanding object-oriented systems is hampered by the fact that the code segments that are related to a user-level function tend to be ...
Walkinshaw, N., Roper, M., Wood, M.
core +4 more sources
Oriented Coloring on Recursively Defined Digraphs
Algorithms, 2019 Coloring is one of the most famous problems in graph theory. The coloring problem on undirected graphs has been well studied, whereas there are very few results for coloring problems on directed graphs. An oriented k-coloring of an oriented graph G =
Frank Gurski +2 more
doaj +1 more source
The complexity of deciding whether a graph admits an orientation with fixed weak diameter [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 An oriented graph $\overrightarrow{G}$ is said weak (resp. strong) if, for every pair $\{ u,v \}$ of vertices of $\overrightarrow{G}$, there are directed paths joining $u$ and $v$ in either direction (resp. both directions).
Julien Bensmail +2 more
doaj +1 more source
Graph-based pattern identification from architecture change logs [PDF]
, 2012 Service-based architectures have become commonplace, creating the need to address their systematic maintenance and evolution. We investigate architecture change representation, primarily focusing on the identification of change patterns that support the ...
Pooyan Jamshidi (5276344) +8 more
core +2 more sources
Graph products of groups [PDF]
, 1990 In the 1970's Baudisch introduced the idea of the semifree group, that is, a group in which the only relators are commutators of generators. Baudisch was mainly concerned with subgroup problems, employing length arguments on the elements of these groups.
Green, E.R, Green, Elisabeth Ruth
core +7 more sources
The Singularity of Oriented Outerplanar Graphs with a Given Number of Inner Edges
Journal of Mathematics, 2022 A digraph is called oriented if there is at most one arc between two distinct vertices. An oriented graph is called nonsingular (singular) if its adjacency matrix AD is nonsingular (singular).
Borui He, Xianya Geng, Long Wang
doaj +1 more source
A formal support to business and architectural design for service-oriented systems [PDF]
, 2011 Architectural Design Rewriting (ADR) is an approach for the design of software architectures developed within Sensoria by reconciling graph transformation and process calculi techniques.
Lluch-Lafuente, Alberto +13 more
core +1 more source
An Oriented Version of the 1-2-3 Conjecture
Discussiones Mathematicae Graph Theory, 2015 The well-known 1-2-3 Conjecture addressed by Karoński, Luczak and Thomason asks whether the edges of every undirected graph G with no isolated edge can be assigned weights from {1, 2, 3} so that the sum of incident weights at each vertex yields a proper ...
Baudon Olivier +2 more
doaj +1 more source
Star complementary characterization of oriented graphs whose skew spectral radius does not exceed 2 [PDF]
Notes on Number Theory and Discrete MathematicsWe employ the method of star complements to classify all oriented graphs whose skew spectrum lies within the interval [-2,2]. At the same time, we provide a structural characterisation of these graphs, showing that, with the sole exception of exactly one
Zoran Stanić
doaj +1 more source