Results 261 to 270 of about 768,033 (273)
Some of the next articles are maybe not open access.
Combinatorics, Probability and Computing, 1996
In this paper, we prove that every graph contains a cycle intersecting all maximum independent sets. Using this, we further prove that every graph with stability number α is spanned by α disjoint cycles. Here, the empty set, the graph of order 1 and the path of order 2 are all considered as degenerate cycles.
Chen, C.C., Jin, G.P.
openaire +2 more sources
In this paper, we prove that every graph contains a cycle intersecting all maximum independent sets. Using this, we further prove that every graph with stability number α is spanned by α disjoint cycles. Here, the empty set, the graph of order 1 and the path of order 2 are all considered as degenerate cycles.
Chen, C.C., Jin, G.P.
openaire +2 more sources
Parallelism in graph-partitioning
Journal of Parallel and Distributed Computing, 1991Abstract Graph partitioning is an important NP-complete problem with applications in VLSI CAD, processor allocation, and many other areas. The problem is to partition vertices of a graph into two equal-sized sets so that the number of edges joining the sets is minimum.
John E. Savage, Markus G. Wloka
openaire +2 more sources
On Partitioning Program Graphs
IEEE Transactions on Software Engineering, 1977In recent years, applications of graph theory to computer software have given fruitful results and attracted more and more attention. A program graph is a graph structural model of a program exhibiting the flow relation or connection among the elements (statements) in the program.
openaire +2 more sources
Journal of Graph Theory, 1997
Packing by induced stars is characterised.
Yoshimi Egawa +2 more
openaire +3 more sources
Packing by induced stars is characterised.
Yoshimi Egawa +2 more
openaire +3 more sources
2017
The analysis of large graph plays a prominent role in various fields of research and application area. Initially, we formally define the partitioning scheme based on user needs and requirements. In this paper, we will be dealing with various methods of graph partitioning, its advantages and disadvantages, and from the result we can conclude which is ...
Tanvi Prabhu Dessai +2 more
openaire +2 more sources
The analysis of large graph plays a prominent role in various fields of research and application area. Initially, we formally define the partitioning scheme based on user needs and requirements. In this paper, we will be dealing with various methods of graph partitioning, its advantages and disadvantages, and from the result we can conclude which is ...
Tanvi Prabhu Dessai +2 more
openaire +2 more sources
2003
Although inexact graph-matching is a problem of potentially exponential complexity, the problem may be simplified by decomposing the graphs to be matched into smaller subgraphs. If this is done, then the process may cast into a hierarchical framework or cast in a way which is amenable to parallel computation.
Huaijun Qiu, Edwin R. Hancock
openaire +2 more sources
Although inexact graph-matching is a problem of potentially exponential complexity, the problem may be simplified by decomposing the graphs to be matched into smaller subgraphs. If this is done, then the process may cast into a hierarchical framework or cast in a way which is amenable to parallel computation.
Huaijun Qiu, Edwin R. Hancock
openaire +2 more sources
2012
Recently, there has been much interest in studying certain graph partitions that generalize graph colourings and homomorphisms. They are described by a pattern, usually viewed as a symmetric {0, 1, *}-matrix M. Existing results focus on recognition algorithms and characterization theorems for graphs that admit such M-partitions, or M-partitions in ...
Pavol Hell +2 more
openaire +1 more source
Recently, there has been much interest in studying certain graph partitions that generalize graph colourings and homomorphisms. They are described by a pattern, usually viewed as a symmetric {0, 1, *}-matrix M. Existing results focus on recognition algorithms and characterization theorems for graphs that admit such M-partitions, or M-partitions in ...
Pavol Hell +2 more
openaire +1 more source
Combinatorica, 2007
Complete partitions of a graph are vertex partitions such that any two classes are related by an arc. The authors compute tight lower and upper bounds for the maximum number of classes in a complete partition. A technique used is that of finding the largest integer \(\beta(G)\) such that there exists a subgraph \(H\subseteq G\) with maximum degree at ...
Magnús M. Halldórsson +3 more
openaire +1 more source
Complete partitions of a graph are vertex partitions such that any two classes are related by an arc. The authors compute tight lower and upper bounds for the maximum number of classes in a complete partition. A technique used is that of finding the largest integer \(\beta(G)\) such that there exists a subgraph \(H\subseteq G\) with maximum degree at ...
Magnús M. Halldórsson +3 more
openaire +1 more source
Mathematical Methods of Operations Research (ZOR), 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
William W. Hager, Yaroslav Krylyuk
openaire +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
William W. Hager, Yaroslav Krylyuk
openaire +3 more sources
On judicious partitions of graphs
Journal of Combinatorial Optimization, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Muhuo Liu, Baogang Xu
openaire +2 more sources