20 results
Search Results
2. Efficient computation of arbitrary control dependencies.
- Author
-
Léchenet, Jean-Christophe, Kosmatov, Nikolai, and Le Gall, Pascale
- Subjects
- *
DIRECTED graphs , *GRAPH theory , *ALGORITHMS - Abstract
In 2011, Danicic et al. introduced an elegant generalization of the notion of control dependence for any directed graph. They also proposed an algorithm computing the weak control-closure of a subset of graph vertices and performed a paper-and-pencil proof of its correctness. We have performed its machine-checked proof in the Coq proof assistant. This paper also presents a novel, more efficient algorithm called lDFS to compute weak control-closure taking benefit of intermediate propagation results of previous iterations in order to accelerate the following ones. This optimization makes the design of the algorithm more complex and requires subtle loop invariants for its proof. lDFS has been formalized and mechanically proven in the Why3 verification tool. To investigate the impact of several possible optimizations and compare the performances of different versions of the algorithm, we perform experiments on arbitrary generated graphs with up to hundreds of thousands of vertices. They demonstrate that the proposed algorithm remains practical for real-life programs and significantly outperforms all considered versions of Danicic's initial technique. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
3. An iteration method for computing the total number of spanning trees and its applications in graph theory.
- Author
-
Ma, Fei and Yao, Bing
- Subjects
- *
FIXED point theory , *CAYLEY graphs , *ALGORITHMS , *GRAPH theory , *SPANNING trees - Abstract
Calculating and analyzing the number of spanning trees of graphs (network models) is an important and interesting research project in wide variety of fields, such as mathematics, physics, theoretical computer science, chemistry and so on. The number of spanning trees of graphs (models) displays amounts of information on its structural features and also on some relevant dynamical properties, in particular network security, random walks and percolation. In this paper, firstly, due to lots of graphs (models) are built on the basis of various simple and small elements (components), we provide primarily some helpful network-operation, such as link-operation and merge-operation, to generate more realistic and complicated graphs (models). Secondly, considering reliability of fault-tolerance to random faults and of intrusion-tolerance to selectively remove attacks, synchronization capability and diffusion properties of networks, we present an iterative method (algorithm) for computing the total number of spanning trees. As a pellucid example, we apply our method to tree space and cycle space, notice that it is proved to be indeed a better tool. In order to reflect more widely practical meanings, we study its applications in graph theory, including ladder-graph with zero clustering coefficient, wheel-graph having nonzero clustering coefficient as constituent ingredients of maximal planar graphs. In the rest of this paper, we make a brief summary that the method described by us can be designed a program (algorithm) for obtaining easily the exact number of spanning trees of some models. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
4. FPT algorithms for domination in sparse graphs and beyond.
- Author
-
Telle, J.A. and Villanger, Y.
- Subjects
- *
SPARSE graphs , *DOMINATING set , *GRAPH theory , *ALGORITHMS , *DENSE graphs - Abstract
Abstract We study the parameterized complexity of domination problems on sparse graphs and beyond. The nowhere dense classes of graphs have been proposed as the main model for sparseness that can be utilized algorithmically. The class of d -degenerate graphs is not nowhere dense, yet domination remains fixed-parameter tractable. Both nowhere dense classes of graphs and d -degenerate graph classes are biclique-free classes, meaning there is an integer t such that no graph in the class contains K t , t as a subgraph. In this paper we show that various domination problems are fixed-parameter tractable on biclique-free classes of graphs. Our algorithms are simple and rely on results from extremal graph theory that bound the number of edges in a t -biclique free graph. In particular, the problems k -Dominating Set , Connected k -Dominating Set , Independent k -Dominating Set and Minimum Weight k -Dominating Set are shown to be FPT, when parameterized by t + k , on graphs not containing K t , t as a subgraph. With the exception of Connected k -Dominating Set all described algorithms are linear in the size of the input graph. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
5. Reachability for airline networks: fast algorithm for shortest path problem with time windows.
- Author
-
Gao, Xiaofeng, Xianzang, Yueyang, You, Xiaotian, Dang, Yaru, Chen, Guihai, and Wang, Xinglong
- Subjects
- *
GRAPH theory , *PATHS & cycles in graph theory , *AIRPORTS , *AIRWAYS (Aeronautics) , *FEATURE extraction , *ALGORITHMS - Abstract
Abstract Airline network, including airports as network nodes and flight routes as directed network edges, has a lot of special features such as departure and arrival times, air ticket budget, flight capacity, transportation cost, etc. Thus, analyzing network behavior and service performance for such a network is much more difficult than that for many other networks. In this paper, taking China domestic airline network as a representative, we try to discuss the reachability issue for each airport respectively, which could reflect its regional connectivity level and service quality of civil aviation. More specifically, we evaluate reachability through many features including node degree, betweenness, closeness, etc. To get the values of some features, we design a fast Dijkstra-based all-pair shortest path algorithm with both time and budget requirements, then use Fenwick Tree to further improve the time efficiency. Actually, it is a shortest path problem with time windows and other constraints. Furthermore, we propose a faster solution by reducing the edges in the duplicated graph as a simplification and then provide the time complexity proof. Finally, we implement Analytic Hierarchy Process (AHP) to convert the reachability feature into numerical values for all airports to measure their service qualities precisely. Our results for China domestic airline network with 210 airports and 69,160 flight routes will definitely become a guide to airline companies and civil aviation administration for their further development and management. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
6. Vertex deletion problems on chordal graphs.
- Author
-
Cao, Yixin, Ke, Yuping, Otachi, Yota, and You, Jie
- Subjects
- *
COMPUTATIONAL complexity , *MATHEMATICAL optimization , *ALGORITHMS , *NP-complete problems , *POLYNOMIALS , *GRAPH theory - Abstract
Abstract Containing many classic optimization problems, the family of vertex deletion problems has an important position in algorithm and complexity study. The celebrated result of Lewis and Yannakakis gives a complete dichotomy of their complexity. It however has nothing to say about the case when the input graph is also special. This paper initiates a systematic study of vertex deletion problems from one subclass of chordal graphs to another. We give polynomial-time algorithms or proofs of NP-completeness for most of the problems. In particular, we show that the vertex deletion problem from chordal graphs to interval graphs is NP-complete. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
7. Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs.
- Author
-
Mezzini, Mauro
- Subjects
- *
GRAPH theory , *PATHS & cycles in graph theory , *INTERVAL analysis , *NP-hard problems , *PLANAR graphs , *ALGORITHMS - Abstract
Abstract Given a graph G and a pair of vertices u , v the interval I G [ u , v ] is the set of all vertices that are in some shortest path between u and v. Given a subset X of vertices of G , the interval I G [ X ] of X , is the union of the intervals for all pairs of vertices in X and we say that X is geodetic if its interval do coincide with the set of vertices in the graph. A minimum geodetic set is a minimum cardinality geodetic set of G. The problem of computing a minimum geodetic set is known to be NP-Hard for general graphs but is known to be polynomially solvable for maximal outerplanar graphs. In this paper we show a polynomial time algorithm for finding a minimum geodetic set in general outerplanar graphs. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
8. Parameterized algorithms for Edge Biclique and related problems.
- Author
-
Feng, Qilong, Li, Shaohua, Zhou, Zeyang, and Wang, Jianxin
- Subjects
- *
BIPARTITE graphs , *GRAPH theory , *ALGORITHMS , *PARAMETERS (Statistics) , *BIOINFORMATICS - Abstract
Maximum Edge Biclique and related problems have wide applications in management science, bioinformatics, etc. In this paper, we study parameterized algorithms for Parameterized Edge Biclique problem, Parameterized Edge Biclique Packing problem, Parameterized Biclique Edge Deletion problem, and Parameterized Bipartite Biclique Clustering problem. For the Parameterized Edge Biclique problem, the current best result is of running time O ⁎ ( 2 k ) , and we give a parameterized algorithm of running time O ( n k 2.5 k ⌈ k ⌉ ) , where k is the parameter and n is the number of vertices in the given graph. For the Parameterized Edge Biclique Packing problem, based on randomized divide-and-conquer technique, a parameterized algorithm of running time O ⁎ ( k ⌈ k ⌉ l o g k 4 ( 2 k − 1 ) t ) ) is given, where k is the parameter and t is the number of bicliques in the solution. We study the Parameterized Biclique Edge Deletion problem on bipartite graphs and general graphs, and give parameterized algorithms of running time O ⁎ ( 2 k ) and O ⁎ ( 3 k ) , respectively. For the Parameterized Bipartite Biclique Clustering problem, based on modular decomposition method, a kernel of size O ( k 2 ) and a parameterized algorithm of running time O ( 2.42 k ( n + m ) ) are presented, where k is the parameter, n is the number of vertices, and m is the number of edges in the given graph. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
9. Parameterized counting matching and packing: A family of hard problems that admit FPTRAS.
- Author
-
Liu, Yunlong, Wang, Shaokai, and Wang, Jianxin
- Subjects
- *
SUBGRAPHS , *GRAPH theory , *GEOMETRIC vertices , *GRAPHIC methods , *INTEGERS , *ALGORITHMS - Abstract
In the field of parameterized counting complexity, the problems that are #W[1]-hard and admit fixed-parameter tractable randomized approximation scheme (FPTRAS) have attracted much attention in recent years. In this paper, we focus on the problems on parameterized counting matching and packing. These problems include counting set packing , counting matching , and counting subgraph packing (including both vertex-disjoint and edge-disjoint versions). We study the parameterized complexity on these problems. On the basis of some results for counting graph matchings, we show that a series of problems are #W[1]-hard. Furthermore, by extending the previous algorithm for counting 3- d matching , we obtain FPTRAS for each considered problem, respectively. Our results indicate that the problems on parameterized counting matching and packing form a large family of problems that are #W[1]-hard and admit FPTRAS. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
10. Optimal coloring for data collection in tree-based wireless sensor networks.
- Author
-
Lo, Shih-Ming, Lin, Wu-Hsiung, Chen, Chiuyuan, and Tseng, Yu-Chee
- Subjects
- *
WIRELESS sensor networks , *GRAPH coloring , *ACQUISITION of data , *ALGORITHMS , *WIRELESS sensor nodes , *PATHS & cycles in graph theory - Abstract
Data collection is an important operation in a wireless sensor network (WSN). During data collection, the interference among nodes cannot be ignored. In a multi-hop WSN, one conventional way of defining interference neighbors is to prohibit a node from using the same time slot as those of its 1-hop and 2-hop neighbors. Recently, it is proved that for data collection in a WSN, since the set of communication nodes is limited and the transmission directions are toward the sink, a less strict set of interference neighbors can be defined [16] . The interference problem in a duty-cycle WSN (DC-WSN) with a corona structure is studied in [7] . In this paper, we solve the same problem by using the relaxed interference set defined in [16] . In particular, we give a complete classification of non-interference sets in 2-hop neighbors. We also propose a distributed 6-coloring algorithm. We prove a lower bound of six colors that every tree-based data collection algorithm requires in a dense DC-WSN, which proves our algorithm to be optimal. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
11. A linear-time algorithm for finding Hamiltonian (s,t)-paths in even-sized rectangular grid graphs with a rectangular hole.
- Author
-
Keshavarz-Kohjerdi, Fatemeh and Bagheri, Alireza
- Subjects
- *
HAMILTONIAN graph theory , *LINEAR time invariant systems , *GEOMETRIC vertices , *ALGORITHMS , *GRAPH theory - Abstract
The Hamiltonian path problem for general grid graphs is NP-complete. In this paper, we give the necessary conditions for the existence of a Hamiltonian path between two given vertices in a rectangular grid graph with a rectangular hole; where the size of graph is even. In addition, we show that the Hamiltonian path in these graphs can be computed in linear-time. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
12. A second look at counting triangles in graph streams (corrected).
- Author
-
Cormode, Graham and Jowhari, Hossein
- Subjects
- *
GRAPH theory , *ALGORITHMS , *MATHEMATICAL analysis , *TOPOLOGY , *MATHEMATICAL proofs - Abstract
In this paper we present improved results on the problem of counting triangles in edge streamed graphs. For graphs with m edges and at least T triangles, we show that an extra look over the stream yields a two-pass streaming algorithm that uses O ( m ε 2.5 T polylog ( m ) ) space and outputs a ( 1 + ε ) approximation of the number of triangles in the graph. This improves upon the two-pass streaming tester of Braverman, Ostrovsky and Vilenchik, ICALP 2013, which distinguishes between triangle-free graphs and graphs with at least T triangle using O ( m T 1 / 3 ) space. Also, in terms of dependence on T , we show that more passes would not lead to a better space bound. In other words, we prove there is no constant pass streaming algorithm that distinguishes between triangle-free graphs from graphs with at least T triangles using O ( m T 1 / 2 + ρ ) space for any constant ρ ≥ 0 . [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
13. Graph editing problems with extended regularity constraints.
- Author
-
Mathieson, Luke
- Subjects
- *
GRAPH theory , *PROBLEM solving , *SUBGRAPHS , *TREE graphs , *COMPUTATIONAL complexity - Abstract
Graph editing problems offer an interesting perspective on sub- and supergraph identification problems for a large variety of target properties. They have also attracted significant attention in recent years, particularly in the area of parameterized complexity as the problems have rich parameter ecologies. In this paper we examine generalisations of the notion of editing a graph to obtain a regular subgraph. In particular we extend the notion of regularity to include two variants of edge-regularity along with the unifying constraint of strong regularity. We present a number of results, with the central observation that these problems retain the general complexity profile of their regularity-based inspiration: when the number of edits k and the maximum degree r are taken together as a combined parameter, the problems are tractable (i.e. in FPT ), but are otherwise intractable. We also examine variants of the basic editing to obtain a regular subgraph problem from the perspective of parameterizing by the treewidth of the input graph. In this case the treewidth of the input graph essentially becomes a limiting parameter on the natural k + r parameterization. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
14. Directed hypergraphs: Introduction and fundamental algorithms—A survey.
- Author
-
Ausiello, Giorgio and Laura, Luigi
- Subjects
- *
GRAPH theory , *GEOMETRY , *HYPERGRAPHS , *ALGORITHMS , *MATHEMATICAL analysis - Abstract
Just as ordinary hypergraphs are a generalization of graphs, directed hypergraphs (DH) are a natural generalization of digraphs. A DH consists of a set of vertices V and a set of hyperarcs H , where a hyperarc is a pair < S , v > , S non empty subset of V and v ∈ V . DHs have a variety of applications: they have been used to represent functional dependency in databases, Horn formulae in propositional logic, and–or graphs, context free grammars etc. In the paper, after providing a brief historical introduction on the notion of DH and some relevant applications, various problems regarding DHs are surveyed and analyzed. In particular we consider the complexity of the reachability problem (together with its application in the related satisfiability problem for Horn CNF formulae) and the computation of transitive closure and transitive reduction of directed hypergraphs (together with its application to the computation of minimum coverings for a set of functional dependencies). Finally a short introduction to the problem of computing shortest hyperpaths in directed hypergraphs is provided. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
15. Approximation algorithm for the balanced 2-connected k-partition problem.
- Author
-
Wu, Di, Zhang, Zhao, and Wu, Weili
- Subjects
- *
APPROXIMATION algorithms , *MATHEMATICAL optimization , *ALGORITHMS , *APPROXIMATION theory , *GRAPH theory - Abstract
For two positive integers m , k and a connected graph G = ( V , E ) with a nonnegative vertex weight function w , the balanced m -connected k -partition problem, denoted as BC m P k , is to find a partition of V into k disjoint nonempty vertex subsets ( V 1 , V 2 , … , V k ) such that each G [ V i ] (the subgraph of G induced by V i ) is m -connected, and min 1 ≤ i ≤ k { w ( V i ) } is maximized. The optimal value of BC m P k on graph G is denoted as β m ⁎ ( G , k ) , that is, β m ⁎ ( G , k ) = max min 1 ≤ i ≤ k { w ( V i ) } , where the maximum is taken over all m -connected k -partition of G . In this paper, we study the BC 2 P k problem on interval graphs, and obtain the following results. (1) For k = 2 , a 4/3-approximation algorithm is given for BC 2 P 2 on 4-connected interval graphs. (2) In the case that there exists a vertex v with weight at least W / k , where W is the total weight of the graph, we prove that the BC 2 P k problem on a 2 k -connected interval graph G can be reduced to the BC 2 P k − 1 problem on the ( 2 k − 1 ) -connected interval graph G − v . In the case that every vertex has weight at most W / k , we prove a lower bound β 2 ⁎ ( G , k ) ≥ W / ( 2 k − 1 ) for 2 k -connected interval graph G . (3) Assuming that weight w is integral, a pseudo-polynomial time algorithm is obtained. Combining this pseudo-polynomial time algorithm with the above lower bound, a fully polynomial time approximation scheme (FPTAS) is obtained for the BC 2 P k problem on 2 k -connected interval graphs. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
16. Linear-time algorithm for sliding tokens on trees.
- Author
-
Demaine, Erik D., Demaine, Martin L., Fox-Epstein, Eli, Hoang, Duc A., Ito, Takehiro, Ono, Hirotaka, Otachi, Yota, Uehara, Ryuhei, and Yamada, Takeshi
- Subjects
- *
LINEAR time invariant systems , *ALGORITHMS , *TREE graphs , *INDEPENDENT sets , *GRAPH theory - Abstract
Suppose that we are given two independent sets I b and I r of a graph such that | I b | = | I r | , and imagine that a token is placed on each vertex in I b . Then, the sliding token problem is to determine whether there exists a sequence of independent sets which transforms I b into I r so that each independent set in the sequence results from the previous one by sliding exactly one token along an edge in the graph. This problem is known to be PSPACE-complete even for planar graphs, and also for bounded treewidth graphs. In this paper, we thus study the problem restricted to trees, and give the following three results: (1) the decision problem is solvable in linear time; (2) for a yes-instance, we can find in quadratic time an actual sequence of independent sets between I b and I r whose length (i.e., the number of token-slides) is quadratic; and (3) there exists an infinite family of instances on paths for which any sequence requires quadratic length. [ABSTRACT FROM AUTHOR]
- Published
- 2015
- Full Text
- View/download PDF
17. Exact algorithms for Kayles.
- Author
-
Bodlaender, Hans L., Kratsch, Dieter, and Timmer, Sjoerd T.
- Subjects
- *
ALGORITHMS , *GAME theory , *GRAPH theory , *SET theory , *MATHEMATICAL bounds - Abstract
In the game of Kayles , two players select alternatingly a vertex from a given graph G , but may never choose a vertex that is adjacent or equal to an already chosen vertex. The last player that can select a vertex wins the game. In this paper, we give an exact algorithm to determine which player has a winning strategy in this game. To analyze the running time of the algorithm, we introduce the notion of a K-set: a nonempty set of vertices W ⊆ V is a K-set in a graph G = ( V , E ) , if G [ W ] is connected and there exists an independent set X such that W = V − N [ X ] . The running time of the algorithm is bounded by a polynomial factor times the number of K-sets in G . We prove that the number of K-sets in a graph with n vertices is bounded by O ( 1.6052 n ) . A computer-generated case analysis improves this bound to O ( 1.6031 n ) K-sets, and thus we have an upper bound of O ( 1.6031 n ) on the running time of the algorithm for Kayles . We also show that the number of K-sets in a tree is bounded by n ⋅ 3 n / 3 and thus Kayles can be solved on trees in O ( 1.4423 n ) time. We show that apart from a polynomial factor, the number of K-sets in a tree is sharp. As corollaries, we obtain that determining which player has a winning strategy in the games G avoid ( POS DNF 2 ) and G seek ( POSDNF 3 ) can also be determined in O ( 1.6031 n ) time. In G avoid ( POSDNF 2 ) , we have a positive formula F on n Boolean variables in Disjunctive Normal Form with two variables per clause. Initially, all variables are false, and players alternately set a variable from false to true; the first player that makes F true loses the game. The game G seek ( POSDNF 3 ) is similar, but now there are three variables per clause, and the first player that makes F true wins the game. [ABSTRACT FROM AUTHOR]
- Published
- 2015
- Full Text
- View/download PDF
18. The swap matching problem revisited.
- Author
-
Ahmed, Pritom, Iliopoulos, Costas S., Islam, A.S.M. Sohidull, and Rahman, M. Sohel
- Subjects
- *
MATCHING theory , *PROBLEM solving , *GRAPH theory , *ALGORITHMS , *STRING theory - Abstract
In this paper, we revisit the much studied problem of Pattern Matching with Swaps (Swap Matching problem, for short). We first present a graph-theoretic model, which opens a new and so far unexplored avenue to solve the problem. Then, using the model, we devise two efficient algorithms to solve the swap matching problem. The resulting algorithms are adaptations of the classic shift-and algorithm. For patterns having length similar to the word-size of the target machine, both the algorithms run in linear time considering a fixed alphabet. [ABSTRACT FROM AUTHOR]
- Published
- 2014
- Full Text
- View/download PDF
19. 2-Connecting outerplanar graphs without blowing up the pathwidth.
- Author
-
Babu, Jasine, Basavaraju, Manu, Chandran, L. Sunil, and Rajendraprasad, Deepak
- Subjects
- *
GRAPH theory , *ALGORITHMS , *PLANAR graphs , *COMPUTER science , *INFORMATION science - Abstract
Given a connected outerplanar graph G of pathwidth p , we give an algorithm to add edges to G to get a supergraph of G , which is 2-vertex-connected, outerplanar and of pathwidth O ( p ) . This settles an open problem raised by Biedl [1] , in the context of computing minimum height planar straight line drawings of outerplanar graphs, with their vertices placed on a two-dimensional grid. In conjunction with the result of this paper, the constant factor approximation algorithm for this problem obtained by Biedl [1] for 2-vertex-connected outerplanar graphs will work for all outer planar graphs. [ABSTRACT FROM AUTHOR]
- Published
- 2014
- Full Text
- View/download PDF
20. A second look at counting triangles in graph streams.
- Author
-
Cormode, Graham and Jowhari, Hossein
- Subjects
- *
TRIANGLES , *GRAPH theory , *APPROXIMATION theory , *RANDOMIZATION (Statistics) , *ALGORITHMS , *MATHEMATICAL bounds - Abstract
In this paper we present improved results on the problem of counting triangles in edge streamed graphs. For graphs with m edges and at least T triangles, we show that an extra look over the stream yields a two-pass streaming algorithm that uses O ( m ϵ 4.5 T ) space and outputs a ( 1 + ϵ ) approximation of the number of triangles in the graph. This improves upon the two-pass streaming tester of Braverman et al. [2] , which distinguishes between triangle-free graphs and graphs with at least T triangles using O ( m T 1 / 3 ) space. Also, in terms of dependence on T , we show that more passes would not lead to a better space bound. In other words, we prove there is no constant pass streaming algorithm that distinguishes between triangle-free graphs from graphs with at least T triangles using O ( m T 1 / 2 + ρ ) space for any constant ρ ≥ 0 . [ABSTRACT FROM AUTHOR]
- Published
- 2014
- Full Text
- View/download PDF
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.