Results 41 to 50 of about 730 (100)

A linear algorithm for obtaining the Laplacian eigenvalues of a cograph

Special Matrices
In this article, we give an O(n)O\left(n) time and space algorithm for obtaining the Laplacian eigenvalues of a cograph. This approach is more efficient as there is no need to directly compute the eigenvalues of Laplacian matrix related to this class of ...
Chen Guantao, Tura Fernando C.
doaj   +1 more source

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  

A polynomial algorithm for the k-cluster problem on interval graphs

, 2008
This paper deals with the problem of finding, for a given graph and a given natural number k, a subgraph of k nodes with a maximum number of edges. This problem is known as the k-cluster problem and it is NP-hard on general graphs as well as on chordal ...
Mertzios, George B.
core   +1 more source

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  

A $4/3$ Approximation for $2$-Vertex-Connectivity [PDF]

TheoretiCS
The 2-Vertex-Connected Spanning Subgraph problem (2VCSS) is among the most basic NP-hard (Survivable) Network Design problems: we are given an (unweighted) undirected graph $G$.
Miguel Bosch-Calvo, Fabrizio Grandoni, Afrouz Jabal Ameli   +2 more
doaj   +1 more source

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  

Faster parameterized algorithms for modification problems to minor-closed classes [PDF]

TheoretiCS
Let ${\cal G}$ be a minor-closed graph class and let $G$ be an $n$-vertex graph. We say that $G$ is a $k$-apex of ${\cal G}$ if $G$ contains a set $S$ of at most $k$ vertices such that $G\setminus S$ belongs to ${\cal G}$.
Laure Morelle, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos   +3 more
doaj   +1 more source

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

Algorithmica, 2023
Misra P, Saurabh S, Sharma R, Zehavi M.
europepmc   +1 more source

Continuous facility location on graphs. [PDF]

Math Program, 2022
Hartmann TA, Lendl S, Woeginger GJ.
europepmc   +1 more source

Counting and optimising maximum phylogenetic diversity sets. [PDF]

J Math Biol, 2022
Manson K, Semple C, Steel M.
europepmc   +1 more source