Making Bidirected Graphs Strongly Connected

09/04/2017
by   Tatsuya Matsuoka, et al.
0

We consider problems to make a given bidirected graph strongly connected with minimum cardinality of additional signs or additional arcs. For the former problem, we show the minimum number of additional signs and give a linear-time algorithm for finding an optimal solution. For the latter problem, we give a linear-time algorithm for finding a feasible solution whose size is equal to the obvious lower bound or more than that by one.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/06/2021

Computing the 4-Edge-Connected Components of a Graph in Linear Time

We present the first linear-time algorithm that computes the 4-edge-conn...
research
09/05/2021

A linear-time algorithm for semitotal domination in strongly chordal graphs

In a graph G=(V,E) with no isolated vertex, a dominating set D ⊆ V, is c...
research
09/09/2022

Multi-Agent Path Finding on Strongly Connected Digraphs: feasibility and solution algorithms

On an assigned graph, the problem of Multi-Agent Pathfinding (MAPF) cons...
research
02/17/2020

Finding All Global Minimum Cuts In Practice

We present a practically efficient algorithm that finds all global minim...
research
03/15/2019

Smallest k-Enclosing Rectangle Revisited

Given a set of n points in the plane, and a parameter k, we consider the...
research
02/23/2019

Optimal Algorithm to Reconstruct a Tree from a Subtree Distance

This paper addresses the problem of finding a representation of a subtre...
research
02/15/2017

Linear Time Computation of Moments in Sum-Product Networks

Bayesian online algorithms for Sum-Product Networks (SPNs) need to updat...

Please sign up or login with your details

Forgot password? Click here to reset