Results 31 to 40 of about 714,042 (275)

Orienting graphs to optimize reachability [PDF]

open access: yesInformation Processing Letters, 1997
The paper focuses on two problems: (i) how to orient the edges of an undirected graph in order to maximize the number of ordered vertex pairs (x,y) such that there is a directed path from x to y, and (ii) how to orient the edges so as to minimize the number of such pairs. The paper describes a quadratic-time algorithm for the first problem, and a proof
S. Louis Hakimi   +2 more
openaire   +4 more sources

Pebbling and optimal pebbling in graphs [PDF]

open access: yesJournal of Graph Theory, 2007
AbstractGiven a distribution of pebbles on the vertices of a graph G, a pebbling move takes two pebbles from one vertex and puts one on a neighboring vertex. The pebbling number Π(G) is the least k such that for every distribution of k pebbles and every vertex r, a pebble can be moved to r.
David P. Bunde   +4 more
openaire   +2 more sources

Improved IMU Preintegration with Gravity Change and Earth Rotation for Optimization-Based GNSS/VINS

open access: yesRemote Sensing, 2020
IMU preintegration technology has been widely used in the optimization-based sensor fusion framework, in order to avoid reintegrating the high-frequency IMU measurements at each iteration and maintain the ability of bias correction when bias estimation ...
Junxiang Jiang, Xiaoji Niu, Jingnan Liu
doaj   +1 more source

The most persistent soft-clique in a set of sampled graphs [PDF]

open access: yes, 2005
When searching for characteristic subpatterns in potentially noisy graph data, it appears self-evident that having multiple observations would be better than having just one.
Quadrianto, Novi   +2 more
core   +3 more sources

Underwater Positioning Method Based on Vision-Inertia-Pressure Fusion

open access: yes水下无人系统学报
In underwater unstructured environments, robots face difficulties in relying on external base stations for localization. Therefore, autonomous localization using multi-sensor fusion has significant application value in such settings.
Jian ZHANG   +4 more
doaj   +1 more source

Telemaco: A Language Oriented Tool for Graph-based Models Layout Optimization

open access: yesJournal of Telecommunications and Information Technology, 2013
Progress of ICT is shifting the paradigm of systems organization towards a distributed approach, in which physical deployment of components influences the evaluation of systems properties. This contribution can be considered as a problem of graph layout
Mauro Iacono, Stefano Marrone
doaj   +1 more source

A Systematic Approach to Constructing Incremental Topology Control Algorithms Using Graph Transformation

open access: yes, 2017
Communication networks form the backbone of our society. Topology control algorithms optimize the topology of such communication networks. Due to the importance of communication networks, a topology control algorithm should guarantee certain required ...
Hollick, Matthias   +5 more
core   +1 more source

Optimal graph Laplacian

open access: yesAutomatica, 2019
This paper provides a construction method of the nearest graph Laplacian to a matrix identified from measurement data of graph Laplacian dynamics that include biochemical systems, synchronization systems, and multi-agent systems. We consider the case where the network structure, i.e., the connection relationship of edges of a given graph, is known.
openaire   +2 more sources

Rubbling and optimal rubbling of graphs

open access: yesDiscrete Mathematics, 2009
A pebbling move on a graph removes two pebbles at a vertex and adds one pebble at an adjacent vertex. Rubbling is a version of pebbling where an additional move is allowed. In this new move one pebble is removed at vertices v and w adjacent to a vertex u and an extra pebble is added at vertex u. A vertex is reachable from a pebble distribution if it is
Christopher Belford, Nándor Sieben
openaire   +3 more sources

Energy Minimization of Discrete Protein Titration State Models Using Graph Theory

open access: yes, 2016
There are several applications in computational biophysics which require the optimization of discrete interacting states; e.g., amino acid titration states, ligand oxidation states, or discrete rotamer angles. Such optimization can be very time-consuming
Baker, Nathan A.   +4 more
core   +2 more sources

Home - About - Disclaimer - Privacy