st-graphs for the Move-making Algorithms
Efficient Algorithms for Listing k Disjoint st-Paths in Graphs
... 1 Introduction Listing paths of various kinds is a classical problem in graphs [7, 13, 17, 18], as it models problems in several contexts. The survey in [4], for instance, provides sev- eral bibliographical ...
15
Algorithms for Matchings in Graphs
... bipartite graphs is discussed and examples of its execution are ...weighted graphs and optimal matchings including a statement and discussion of the Hungarian ...
11
Making the Move to Digital Textbooks
... the course.) Offering “students for whom it is functionally and psychologically important [to have a paper text] the ability to buy one,” Trinkle says, has helped ensure an overall positive reaction from students. ...
8
Reconstruction Algorithms for Permutation Graphs and Distance-Hereditary Graphs
... circular-arc graphs (of course there are other non-GI-hard classes such as threshold ...circular-arc graphs may be a challenging ...circle graphs is solvable in polynomial time in a similar way ...
8
Properties and Algorithms of the KCube Graphs
... bipartite graphs, because after we convert the KCube into KCube bipartite graphs, we “split” each hypercube cluster into two equal ...bipartite graphs, the remote arcs show how data transfers among ...
90
Algorithms over Dynamic Graphs
... dynamic graphs as graphs in wich some components (arcs, edges, costs) change with respect to a continuous ...explores graphs with dynamic costs as a bundle, and includes the formulation and the ...
7
Some Algorithms on Cactus Graphs
... O time [1]. A lot of work have been done in improving this running time using randomization and probabilistic methods for general as well as special kinds of graphs. Ahuja et.al. [2] have given a faster sequential ...
15
Fast algorithms for decomposable graphs
... Not much later, Courcelle’s Theorem was extended by Arnborg, Lagergren, and Seese [8], who proved that the result can be lifted to a large class of decision, optimization and counting problems. For this they define an ...
287
Approximation algorithms for intersection graphs
... Table 1 summarizes the best previously known and new approximation results for the intersection graphs of disks, regular polygons, fat objects, t-intervals and t-fat-objects. MIS denotes the unweighted version of ...
17
Making the move: information for families of children with a disability making the move from primary to secondary school
... For example, some students with a disability will move from a regular class with support in the local primary school to regular classes with support in a secondary school. Others may attend the same specialist ...
20
Parameterized Algorithms on Perfect Graphs for Deletion to (r,l)-Graphs
... perfect graphs is NP-hard, because of this ...perfect graphs, we do not expect Vertex Partization on perfect graphs to be FPT when parameterized by k alone, again under the assumption that P 6= ...
13
Making the Move to High Value Consulting
... However, the move can be a lucrative one, bringing higher levels of profitability and sustaining competitive differentiation. Future State has been successful in its transformation from a staff augmentation firm ...
14
Making the move from ISDN to SIP
... In essence, the first step of the migration process is to map out the customer’s existing phone network. Ask the customer to find out how calls are handled for every department and document that call flow. The customer ...
8
Algorithms for 3PC(.,.)-free Berge graphs
... time algorithms, avoiding the numerical instability of the ellipsoid ...perfect graphs that generalizes claw-free perfect graphs and square-free perfect ...
25
Efficient algorithms for computing Reeb graphs
... Planar graphs can be embedded on the sphere, a 2-manifold whose genus equals ...Non-planar graphs cannot be embedded on the sphere, but they can be embedded on a higher genus ...
11
Approximation Algorithms for Partially Colorable Graphs
... However, the two cases above clearly do not cover the full range of instances that we can encounter in our model. Therefore, we need a way to relax the above two characterizations which allows for a seamless transition ...
20
Two Algorithms For Coloring Permutation Graphs
... 1,2,3Mathematics Department, Faculty of science AlAzhar University Cairo- Egypt Abstract: - In the first part of this paper we introduce new two algorithms for coloring permutation graphs.by this algorithm we can ...
12
On graph algorithms for large-scale graphs
... Stream Algorithms In a graph data stream, the input graph is defined by a data stream which in this thesis consists of insertions and deletions of ...streaming algorithms on graphs are in the ...
168
Algorithms for Grid Graphs in the MapReduce Model
... probabilistic algorithms which solve maximal matching, approximate maximum weighted matching, minimum spanning tree, and approximate minimum edge cut in a constant number of rounds ...these algorithms were ...
46
Heuristic Algorithms For Broadcasting In Cactus Graphs
... to move edges in the last bucket to earlier empty ...BroadcastBucket algorithms will return a boolean value depending on it if is possible to broadcast in the given time ...
68