A simple linear time algorithm for finding a maximum independent set of circular arcs using intervals alone

Networks ◽  
2002 ◽  
Vol 39 (2) ◽  
pp. 68-72 ◽  
Author(s):  
Glenn K. Manacher ◽  
Terrance A. Mankus
Keyword(s):  
Linear Time ◽  
Independent Set ◽  
Time Algorithm ◽  
Maximum Independent Set ◽  
Linear Time Algorithm ◽  
Circular Arcs

scholarly journals An Efficient and Fast Algorithm for Routing Over the Cells

VLSI Design ◽  
1996 ◽  
Vol 5 (1) ◽  
pp. 1-10
Author(s):  
Kuo-En Chang ◽  
Sei-Wang Chen
Keyword(s):  
Fast Algorithm ◽  
Linear Time ◽  
Independent Set ◽  
Time Algorithm ◽  
Intersection Graph ◽  
Linear Time Algorithm ◽  
Channel Density ◽  
Cpu Time

A linear time algorithm for routing over the cells is presented. The algorithm tries to reduce maximum channel density by routing some connections over the cells. The algorithm first defines a new scheme for channel representation and formulates the problem based on an intersection graph derived from the new scheme. Then, a feasible independent set of the intersection graph is found for routing some subnets over the cells. The algorithm is implemented and evaluated with several well known benchmarks. In comparison with previous research, our results are satisfactory, and the algorithm takes substantially less CPU time than those of previous works. For Deutsch's difficult example, the previous algorithms take about 29.25 seconds on an average but our new algorithm needs only 5.6 seconds.

scholarly journals On the k -Component Independence Number of a Tree

2021 ◽  
Vol 2021 ◽  
pp. 1-4
Author(s):  
Shuting Cheng ◽  
Baoyindureng Wu
Keyword(s):  
Linear Time ◽  
Independence Number ◽  
Independent Set ◽  
Time Algorithm ◽  
Linear Time Algorithm ◽  
Maximum Order ◽  
Component Order

Let G be a graph and k ≥ 1 be an integer. A subset S of vertices in a graph G is called a k -component independent set of G if each component of G S has order at most k . The k -component independence number, denoted by α c k G , is the maximum order of a vertex subset that induces a subgraph with maximum component order at most k . We prove that if a tree T is of order n , then α k T ≥ k / k + 1 n . The bound is sharp. In addition, we give a linear-time algorithm for finding a maximum k -component independent set of a tree.

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.

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