Making Bidirected Graphs Strongly Connected
| Autor: | Shun Sato, Tatsuya Matsuoka |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
FOS: Computer and information sciences
Strongly connected component Discrete Mathematics (cs.DM) General Computer Science Applied Mathematics Contrast (statistics) Directed graph Upper and lower bounds Computer Science Applications Combinatorics Bidirected graph Theory of computation 05C85 Cardinality (SQL statements) Computer Science - Discrete Mathematics MathematicsofComputing_DISCRETEMATHEMATICS Mathematics |
| Zdroj: | Algorithmica. 82:787-807 |
| ISSN: | 1432-0541 0178-4617 |
| DOI: | 10.1007/s00453-019-00613-5 |
| Popis: | 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. Comment: 14pages |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink