Results 11 to 20 of about 4,664 (221)
Graph Theoretic Algorithms Adaptable to Quantum Computing [PDF]
, 2021 Computational methods are rapidly emerging as an essential tool for understanding and solving complex engineering problems, which complement the traditional tools of experimentation and theory.
Srivastava, Siddhartha
core +1 more source
From Graph Theory to Graph Algorithms, and Back [PDF]
, 2022 Graphs are among the objects that have been studied in Mathematics and Computer Science for decades. Two prominent areas that are dedicated to the study of graphs are Graph Theory, which studies the structural properties of graphs, and Graph Algorithms ...
Tan, Zihan
core +1 more source
Large-girth roots of graphs [PDF]
, 2010 We study the problem of recognizing graph powers and computing roots of graphs. Our focus is on classes of graphs with no short cycles. We provide a polynomial time recognition algorithm for r-th powers of graphs of girth at least 2r vertical bar 3, thus
Adamaszek, Michal +4 more
core +1 more source
Testing first-order properties for subclasses of sparse graphs [PDF]
, 2013 We present a linear-time algorithm for deciding first-order (FO) properties in classes of graphs with bounded expansion, a notion recently introduced by Nešetřil and Ossona de Mendez.
Thomas, Robin +2 more
core +1 more source
Vertex and edge covers with clustering properties: complexity and algorithms [PDF]
, 2009 We consider the concepts of a t-total vertex cover and a t-total edge cover (t≥1), which generalise the notions of a vertex cover and an edge cover, respectively.
Fernau, Henning +3 more
core +1 more source
Towards a Maude tool for model checking temporal graph properties
, 2011 We present our prototypical tool for the verification of graph transformation systems. The major novelty of our tool is that it provides a model checker for temporal graph properties based on counterpart semantics for quantified m-calculi.
Lluch-Lafuente, Alberto +4 more
core +1 more source
Heuristic Search for the Analysis of Graph Transition Systems
, 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 +5 more
core +1 more source
Enhancing big graph analytics: from efficiency to accuracy [PDF]
, 2023 This dissertation presents my work in enhancing analytics on big graphs in aspects of both efficiency and accuracy. Firstly, we propose a notion of partition transparency, such that graph algorithms are able to work correctly under different partitions,
Liu, Muyang
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 net-works.
Michalak, T +13 more
core +1 more source
FEBS Open Bio, EarlyView.This protocol paper outlines methods to establish the success of a time‐resolved serial crystallographic experiment, by means of statistical analysis of timepoint data in reciprocal space and models in real space. We show how to amplify the signal from excited states to visualise structural changes in successful experiments.
Jake Hill +4 more
wiley +1 more source