[PDF] Top 20 The minimum spanner problem on butterfly graphs
Has 10000 "The minimum spanner problem on butterfly graphs" found on our website. Below are the top 20 most common "The minimum spanner problem on butterfly graphs".
The minimum spanner problem on butterfly graphs
... In [2], Harbane and Pa& constructed 3-spanners of the complete generalized p-cycle graphs, which represent a family of underlying graphs produced by the conjunction of [r] ... See full document
6
ON MINIMUM CRITICALLY N-EDGE-CONNECTED GRAPHS
... In this paper, we first discuss some properties of minimum graphs, then show that the problem of finding a minimum critically n-edge-connected spanning subgraph of a given graph G is NP-[r] ... See full document
11
A Linear Time Algorithm for Solving the Incidence Coloring Problem of Chordal Graphs
... G. The incidence coloring prob- lem is a variation of vertex coloring ...problem. The problem is to find the minimum number (called in- cidence coloring number) of colors needed ... See full document
4
On the Optimum Requirement Graph Problem
... ing the minimum spanning tree and the short-path tree of a specified ...node. The NP-hardness of find- ing the minimum diameter subgraph with budget constraint was established in ... See full document
5
Cycle Embedding on the Edge Fault Star Graphs
... to the number of vertices in the graph, is the pancyclic ...focus on such a problem on the star graphs proposed by Akers ...Since the star graphs are ... See full document
9
On the Extremal Number of Edges in Hamiltonian Graphs
... In the past years, the studies on hamiltonian graphs have largely focused on their re- lationship to the Four Color ...recently, the study of hamiltonian cycle in gen- ... See full document
7
On the minimum weight problem of permutation codes under Chebyshev distance
... 1. The permutations mapped from satisfying as- signments have weight 6 and the permutations mapped from unsatisfying assignments have weight ...be the permutation obtained from an assignment σ of φ. ... See full document
5
Two Variations of the Minimum Steiner Problem
... for the minimum Steiner tree problem makes use of the fact that a minimum Steiner tree is a minimum spanning tree on the set of vertices in the ...choosing ... See full document
22
The L(2,1)-labeling problem on graphs
... To formulate the problem in graphs, the transmitters are represented by the vertices of a graph; two vertices are "very close" if they are adjacent in the graph and "close[r] ... See full document
8
Algorithmic aspects of the generalized clique-transversal problem on chordal graphs
... bDepartment of Applied Mathematics. The problem includes the clique-transversal problem, the i, 1 clique-cover problem, and for perfect graphs, the maximum q-colorabl[r] ... See full document
15
Cycle embedding in faulty wrapped butterfly graphs
... INTRODUCTION The performance of a distributed system is significantly determined by its network ...topology. The hypercube (binary n-cube) is one of the most popular interconnection net- ...that ... See full document
12
The Edge-Orientation Problem and Its Variants on Some Classes of Graphs
... general, the used techniques and the algorithmic results of this paper may have great help for implementing the Weighted Fair Queuing (WFQ) on real ...networks. The major goal of ... See full document
20
Proper interval graphs and the guard problem
... We also study the guard problem in spiral polygons by connecting the class of nontrivial connected proper interval graphs with the class of stick-intersection graphs of s[r] ... See full document
8
An optimal algorithm for the minimum disc cover problem
... Abstract The minimum disc cover can be used to construct a dominating set on the fly for energy-efficient communications in mobile ad hoc networks, but the approach used to compute ... See full document
14
AN EFFICIENT APPROACH TO SOLVING THE MINIMUM SUDOKU PROBLEM
... open problem to find the minimum-clue Sudoku puzzles, also commonly called the minimum Sudoku ...Solving the problem can be done by checking 5,472,730,538 essentially ... See full document
18
THE PATH-PARTITION PROBLEM IN BLOCK GRAPHS
... Pandu Rangan, Linear algorithm for optimal path cover problem on interval graphs, Inform.. Bonuccelli and D.P.[r] ... See full document
6
The beta-assignment problem in general graphs
... Our algorithm also requires the following augmenting trail operations: (1) X-augmenting trail detecting; (2) backtracking; (3) finding appropriate X-alternating trails[r] ... See full document
9
THE DOMATIC NUMBER PROBLEM IN INTERVAL-GRAPHS
... Received by the editors June 30, 1989; accepted for publication (in revised form) March 6, 1990. Redistribution subject to SIAM license or copyright; see http://www.siam.org/journals/ojs[r] ... See full document
6
Mutually independent hamiltonian cycles of binary wrapped butterfly graphs
... paper, the mutually independent hamiltonicity is addressed for its effective utilization of resources on the binary wrapped butterfly ...emphasize the order of vertices on C ... See full document
12
Fault-free Hamiltonian cycles in faulty butterfly graphs
... r-dimensional k-ary butterfly graph with 2k - 2 edge faults contains a Hamiltonian cycle. However, the proof seems very hard[r] ... See full document
6
相關主題