Suchergebnisse - computational complexity of graph problems

Graph Algorithms and Applications

“… Unfortunately, the related algorithms usually suffer from high computational complexity, since some of these problems are NP-hard …”
Volltext

Special Issue on “Graph Algorithms and Applications” von Cicerone, Serafino, Di Stefano, Gabriele

“… , frequency allocation in wireless networks, and bioinformatics. Unfortunately, the related algorithms usually suffer from high computational complexity, since some of these problems are NP-hard …”
Volltext

A survey on alliances and related parameters in graphs von Fernau, Henning, Rodrıguez-Velazquez, Juan A.

“… In this paper, we show that several graph parameters are known in different areas under completely different names …”
Volltext

The computational complexity of Holant problems on 3-regular graphs von Yang, Peng, Huang, Yuan, Fu, Zhiguo

Volltext

The computational complexity of three graph problems for instances with bounded minors of constraint matrices von Gribanov, D.V., Malyshev, D.S.

“… We consider boolean linear programming formulations of the independent set, the vertex and the edge dominating set problems and prove their polynomial-time solvability for classes of graphs with (augmented …”
Volltext

On a Countable Family of Boundary Graph Classes for the Dominating Set Problem von Dakhno, G. S., Malyshev, D. S.

“… If this set is finite, then the class is said to be finitely defined. The concept of a boundary class is a useful tool for the analysis of the computational complexity of graph problems in the family of finitely defined classes …”
Volltext

On the computational complexity of dynamic graph problems von Ramalingam, G., Reps, Thomas

“… A common way to evaluate the time complexity of an algorithm is to use asymptotic worst-case analysis and to express the cost of the computation as a function of the size of the input …”
Volltext

Strong Total Monophonic Problems in Product Graphs, Networks, and Its Computational Complexity von Varghese, Eddith Sarah, Xavier, D. Antony, Alsinai, Ammar, Mathew, Deepa, Amirtha Raja, S. Arul, Ahmed, Hanan

“… Let G be a graph with vertex set as VG and edge set as EG which is simple as well as connected …”
Volltext

Computational complexity of counting problems on 3-regular planar graphs von Xia, Mingji, Zhang, Peng, Zhao, Wenbo

“… A variety of counting problems on 3-regular planar graphs are considered in this paper …”
Volltext

How to transform graph states using single-qubit operations: computational complexity and algorithms von Dahlberg, Axel, Helsen, Jonas, Wehner, Stephanie

“… Graph states are ubiquitous in quantum information with diverse applications ranging from quantum network protocols to measurement based quantum computing …”
Volltext

On the Computational Complexity of Optimization Convex Covering Problems of Graphs von Radu Buzatu

“… In this paper we present further studies of convex covers and convex partitions of graphs …”
Volltext

Computational complexity of minimum P 4 vertex cover problem for regular and K 1 , 4 -free graphs von Safina Devi, N., Mane, Aniket C., Mishra, Sounaka

Volltext

Complexity of the Directed Robust b‐Matching Problem and Its Variants on Different Graph Classes von Segschneider, Jenny, Koster, Arie M. C. A.

“… ABSTRACT The b$$ b $$‐matching problem is a well‐known generalization of the classical matching problem with various applications in operations research and computer science …”
Volltext

Hardness and efficiency on t-admissibility for graph operations von Couto, Fernanda, Cunha, Luís Felipe I.

“… The t-admissibility problem aims to decide whether a graph G has a spanning tree T in which the distance between any two adjacent vertices of G is at most …”
Volltext

Critical elements in combinatorially closed families of graph classes von Malyshev, D. S.

“… The notions of boundary and minimal hard classes of graphs, united by the term “critical classes,” are useful tools for analysis of computational complexity of graph problems in the family of hereditary graph classes …”
Volltext

The computational complexity of the backbone coloring problem for planar graphs with connected backbones von Janczewski, Robert, Turowski, Krzysztof

“… In the paper we study the computational complexity of the backbone coloring problem for planar graphs with connected backbones …”
Volltext

The computational complexity of the backbone coloring problem for bounded-degree graphs with connected backbones von Janczewski, Robert, Turowski, Krzysztof

“… In this paper, we study the backbone coloring problem for bounded-degree graphs with connected backbones and we give a complete computational complexity classification of this problem …”
Volltext

Computational complexity of the graph approximation problem von Ageev, A. A., Il’ev, V. P., Kononov, A. V., Talevnin, A. S.

“… The computational complexity of the graph approximation problem is investigated. It is shown that the different variants of this problem are NP-hard both for undirected and directed graphs …”
Volltext

Computational complexity of minimum vertex cover problem for regular and -free graphs von Devi, NSafina, Mane, Aniket C, Mishra, Sounaka

“… In problem, it is asked to find a set of minimum size such that contains no path on 4 vertices, in a given graph …”
Volltext

Fixed interval scheduling: Models, applications, computational complexity and algorithms von Kovalyov, Mikhail Y., Ng, C.T., Cheng, T.C. Edwin

“… The defining characteristic of fixed interval scheduling problems is that each job has a finite number of fixed processing intervals …”
Volltext