A linear-time algorithm for finding a sparsek-connected spanning subgraph of ak-connected graph

Algorithmica ◽  
1992 ◽  
Vol 7 (1-6) ◽  
pp. 583-596 ◽  
Author(s):  
Hiroshi Nagamochi ◽  
Toshihide Ibaraki
Keyword(s):  
Connected Graph ◽  
Linear Time ◽  
Time Algorithm ◽  
Linear Time Algorithm ◽  
Spanning Subgraph

scholarly journals A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph

2017 ◽  
Vol 218 ◽  
pp. 98-112 ◽  
Author(s):  
Insung Ihm ◽  
Jung-Heum Park
Keyword(s):  
Connected Graph ◽  
Linear Time ◽  
Time Algorithm ◽  
Disjoint Path ◽  
Linear Time Algorithm ◽  
Path Cover

A linear time algorithm for the Bottleneck Biconnected Spanning Subgraph problem

1996 ◽  
Vol 59 (1) ◽  
pp. 1-7 ◽  
Author(s):  
Gurmeet Singh Manku
Keyword(s):  
Linear Time ◽  
Time Algorithm ◽  
Linear Time Algorithm ◽  
Spanning Subgraph

scholarly journals The maximum weight spanning star forest problem on cactus graphs

2015 ◽  
Vol 07 (02) ◽  
pp. 1550018 ◽  
Author(s):  
Viet Hung Nguyen
Keyword(s):  
Connected Graph ◽  
Genomic Sequence ◽  
Linear Time ◽  
Polynomial Time Algorithm ◽  
Time Algorithm ◽  
Linear Time Algorithm ◽  
Connected Component ◽  
Maximum Weight ◽  
Cactus Graphs ◽  
Np Hardness

A star is a graph in which some node is incident with every edge of the graph, i.e., a graph of diameter at most 2. A star forest is a graph in which each connected component is a star. Given a connected graph G in which the edges may be weighted positively. A spanning star forest of G is a subgraph of G which is a star forest spanning the nodes of G. The size of a spanning star forest F of G is defined to be the number of edges of F if G is unweighted and the total weight of all edges of F if G is weighted. We are interested in the problem of finding a Maximum Weight spanning Star Forest (MWSFP) in G. In [C. T. Nguyen, J. Shen, M. Hou, L. Sheng, W. Miller and L. Zhang, Approximating the spanning star forest problem and its applications to genomic sequence alignment, SIAM J. Comput. 38(3) (2008) 946–962], the authors introduced the MWSFP and proved its NP-hardness. They also gave a polynomial time algorithm for the MWSF problem when G is a tree. In this paper, we present a linear time algorithm that solves the MSWF problem when G is a cactus.

scholarly journals Emparelhamentos Conexos

2020 ◽  
Author(s):  
Bruno P. Masquio ◽  
Paulo E. D. Pinto ◽  
Jayme L. Szwarcfiter
Keyword(s):  
Connected Graph ◽  
Graph Matching ◽  
Linear Time ◽  
Time Algorithm ◽  
Maximum Matching ◽  
Linear Time Algorithm ◽  
Induced Subgraphs ◽  
Matching Problems ◽  
General Graph ◽  
The One

Graph matching problems are well known and studied, in which we want to find sets of pairwise non-adjacent edges. Recently, there has been an interest in the study of matchings in which the induced subgraphs by the vertices of matchings are connected or disconnected. Although these problems are related to connectivity, the two problems are probably quite different, regarding their complexity. While the complexity of finding a maximum disconnected mat- ching is still unknown for a general graph, the one for connected matchings can be solved in polynomial time. Our contribution in this paper is a linear time algorithm to find a maximum connected matching of a general connected graph, given a general maximum matching as input.

scholarly journals Total Roman {3}-Domination: The Complexity and Linear-Time Algorithm for Trees

Mathematics ◽  
2021 ◽  
Vol 9 (3) ◽  
pp. 293
Author(s):  
Xinyue Liu ◽  
Huiqin Jiang ◽  
Pu Wu ◽  
Zehui Shao
Keyword(s):  
Linear Time ◽  
Minimum Weight ◽  
Domination Number ◽  
Time Algorithm ◽  
Simple Graph ◽  
Linear Time Algorithm ◽  
Domination Problem ◽  
Np Complete ◽  
Chordal Bipartite Graphs ◽  
Dominating Function

For a simple graph G=(V,E) with no isolated vertices, a total Roman {3}-dominating function(TR3DF) on G is a function f:V(G)→{0,1,2,3} having the property that (i) ∑w∈N(v)f(w)≥3 if f(v)=0; (ii) ∑w∈N(v)f(w)≥2 if f(v)=1; and (iii) every vertex v with f(v)≠0 has a neighbor u with f(u)≠0 for every vertex v∈V(G). The weight of a TR3DF f is the sum f(V)=∑v∈V(G)f(v) and the minimum weight of a total Roman {3}-dominating function on G is called the total Roman {3}-domination number denoted by γt{R3}(G). In this paper, we show that the total Roman {3}-domination problem is NP-complete for planar graphs and chordal bipartite graphs. Finally, we present a linear-time algorithm to compute the value of γt{R3} for trees.

scholarly journals Three-coloring triangle-free graphs on surfaces VII. A linear-time algorithm

2021 ◽  
Author(s):  
Zdeněk Dvořák ◽  
Daniel Král' ◽  
Robin Thomas
Keyword(s):  
Linear Time ◽  
Time Algorithm ◽  
Linear Time Algorithm ◽  
Graphs On Surfaces

A Linear time algorithm for deciding security

1976 ◽  
Author(s):  
A. K. Jones ◽  
R. J. Lipton ◽  
L. Snyder
Keyword(s):  
Linear Time ◽  
Time Algorithm ◽  
Linear Time Algorithm

AN IMPROVED ALGORITHM FOR FINDING TREE DECOMPOSITIONS OF SMALL WIDTH

2000 ◽  
Vol 11 (03) ◽  
pp. 365-371 ◽  
Author(s):  
LJUBOMIR PERKOVIĆ ◽  
BRUCE REED
Keyword(s):  
Linear Time ◽  
Time Algorithm ◽  
Tree Decomposition ◽  
Linear Time Algorithm ◽  
Input Graph ◽  
Primary Motivation ◽  
Small Width ◽  
Tree Decompositions ◽  
Improved Algorithm

We present a modification of Bodlaender's linear time algorithm that, for constant k, determine whether an input graph G has treewidth k and, if so, constructs a tree decomposition of G of width at most k. Our algorithm has the following additional feature: if G has treewidth greater than k then a subgraph G′ of G of treewidth greater than k is returned along with a tree decomposition of G′ of width at most 2k. A consequence is that the fundamental disjoint rooted paths problem can now be solved in O(n2) time. This is the primary motivation of this paper.

Sign in / Sign up

Export Citation Format

Share Document