Gaining Insights into Conceptual Models: A Graph-Theoretic Querying Approach
Applied Sciences, 2021 Modern complex systems include products and services that comprise many interconnected pieces of integrated hardware and software, which are expected to serve humans interacting with them. As technology advances, expectations of a smooth, flawless system
Danny Medvedev, Uri Shani, Dov Dori
doaj +1 more source
Graph theoretic and algorithmic aspect of the equitable coloring problem in block graphs
Discrete Mathematics & Theoretical Computer Science, 2022 An equitable coloring of a graph $G=(V,E)$ is a (proper) vertex-coloring of $G$, such that the sizes of any two color classes differ by at most one. In this paper, we consider the equitable coloring problem in block graphs. Recall that the latter are graphs in which each 2-connected component is a complete graph.
Hanna Furmańczyk, Vahan Mkrtchyan
openaire +4 more sources
Improving sentiment analysis with learning concepts from concept, patterns lexicons and negations
Ain Shams Engineering Journal, 2022 The way of expressing sentiment (−ve/+ve) in the form of textual information depends on the way of thinking of human beings. Identifying aspect extraction and sentiment polarity from written texts is a crucial task.
Anima Pradhan +2 more
doaj +1 more source
Editorial: Topological investigations of chemical networks
Main Group Metal Chemistry, 2021 The topic of computing the topological indices (TIs) being a graph-theoretic modeling of the networks or discrete structures has become an important area of research nowadays because of its immense applications in various branches of the applied sciences.
Javaid Muhammad, Imran Muhammad
doaj +1 more source
Visualising the structure of document search results: A comparison of graph theoretic approaches [PDF]
, 2009 This is the post-print of the article - Copyright @ 2010 Sage PublicationsPrevious work has shown that distance-similarity visualisation or ‘spatialisation’ can provide a potentially useful context in which to browse the results of a query search ...
Busing F. +7 more
core +1 more source
Efficient computation of the Shapley value for game-theoretic network centrality [PDF]
, 2013 The Shapley value—probably the most important normative payoff division scheme in coalitional games—has recently been advocated as a useful measure of centrality in networks.
Aaditha, K. V. +4 more
core +3 more sources
Clustering and Community Detection in Directed Networks: A Survey [PDF]
, 2013 Networks (or graphs) appear as dominant structures in diverse domains, including sociology, biology, neuroscience and computer science. In most of the aforementioned cases graphs are directed - in the sense that there is directionality on the edges ...
Malliaros, Fragkiskos D. +1 more
core +1 more source
Graph Isomorphism for unit square graphs [PDF]
, 2016 In the past decades for more and more graph classes the Graph Isomorphism Problem was shown to be solvable in polynomial time. An interesting family of graph classes arises from intersection graphs of geometric objects.
Neuen, Daniel
core +2 more sources
Graph theoretic methods for the analysis of structural relationships in biological macromolecules [PDF]
, 2005 Subgraph isomorphism and maximum common subgraph isomorphism algorithms from graph theory provide an effective and an efficient way of identifying structural relationships between biological macromolecules.
Altschul +72 more
core +3 more sources
A graph rewriting programming language for graph drawing [PDF]
, 1998 This paper describes Grrr, a prototype visual graph drawing tool. Previously there were no visual languages for programming graph drawing algorithms despite the inherently visual nature of the process.
Rodgers, Peter
core +1 more source