05c85 - Open Access .click

Results 41 to 50 of about 703 (75)

The metric dimension and metric independence of a graph [PDF]

, 2001
A vertex x of a graph G resolves two vertices u and v of G if the distance from x to u does not equal the distance from x to v. A set S of vertices of G is a resolving set for G if every two distinct vertices of G are resolved by some vertex of S. The
Currie, James, Oellerman, Ortrud R.
core

Evaluating a weighted graph polynomial for graphs of bounded tree-width [PDF]

, 2009
We show that for any $k$ there is a polynomial time algorithm to evaluate the weighted graph polynomial $U$ of any graph with tree-width at most $k$ at any point.
Noble, S D
core

Optimum matchings in weighted bipartite graphs [PDF]

, 2014
Given an integer weighted bipartite graph $\{G=(U\sqcup V, E), w:E\rightarrow \mathbb{Z}\}$ we consider the problems of finding all the edges that occur in some minimum weight matching of maximum cardinality and enumerating all the minimum weight perfect
C. Vargas, Carlos E. Valencia, Marcos
core

An algorithm to prescribe the configuration of a finite graph [PDF]

, 2010
We provide algorithms involving edge slides, for a connected simple graph to evolve in a finite number of steps to another connected simple graph in a prescribed configuration, and for the regularization of such a graph by the minimization of an ...
Baird, Paul, Tiba, Marius
core

A Metaheuristic Approach to Solving the Generalized Vertex Cover Problem [PDF]

, 2010
AMS Subj. Classiﬁcation: 90C27, 05C85, 90C59The topic is related to solving the generalized vertex cover problem (GVCP) by genetic algorithm. The problem is NP-hard as a generalization of well-known vertex cover problem which was one of the ﬁrst problems
Milanović, Marija
core

Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number. [PDF]