Size, shape, volume fraction and distribution of embedded g/ phase in g phase has direct effect on strength of INCONEL alloy. Microstructure parameters of INCONEL phases are quantified from microstructure images using transmission electron microscopy (TEM). Different TEM sample preparation techniques were used to study INCONEL 738 alloy microstructure for transmission electron micros...

Poljak, S. and D. Turzik, Max-cut in circulant graphs, Discrete Mathematics 108 (1992) 379-392. We study the max-cut problem in circulant graphs C,,,, where C,,, is a graph whose edge set consists of a cycle of length n and all the vertex pairs of distance r on the cycle. An efficient solution of the problem is obtained so that we show that there is always a maximum cut of a particular shape, c...

We introduce the notion of partial kernelization where instead of bounding the size of the whole input we bound the size of the part of the input having particular property. We apply this notion to the multiway cut problem and show how to bound the number of vertices participating in small isolating cuts. We argue that the proposed results provide a considerable progress towards understanding t...

We give query-efficient algorithms for the global min-cut and the s-t cut problem in unweighted, undirected graphs. Our oracle model is inspired by the submodular function minimization problem: on query S ⊂ V , the oracle returns the size of the cut between S and V \ S. We provide algorithms computing an exact minimum s-t cut in G with Õ(n5/3) queries, and computing an exact global minimum cut ...

This paper presents an emulation tool and the way in which it supports the test-driven design of zerodeadlock cut-to-size plants. In contrast to previous plant layouts featuring a linear material flow, panels can now be allocated to the same saw again for their further partitioning. The resulting circles in the material flow of cut-to-size plants impose new challenges as they may cause deadlock...

Given a graph G = (V;E), a weight function w : E ! R+ and a parameter k we examine a family of maximization problems arising naturally when considering a subset U V of size exactly k. Speci cally we consider the problem of nding a subset U V of size k that maximizes : Max-k-Vertex Cover : the weight of edges incident with vertices in U . Max-k-Dense Subgraph : the weight of edges in the subgrap...