Network Feeder Reconfiguration is the process of altering the topological structure of distribution feeders by changing the open/closed status of the tie and sectionalizing switches. In this paper, the Network Reconfiguration problem will be formulated as multi objective optimization problem with equality and inequality constraints. The proposed solution is based on optimization algorithms know...

Let J3 be the number of vertices commonly adjacent to any pair of non-adjacent vertices. It is proved that every strongly regular graph with even order and J3 ~ 1 is l-extendable. We also show that every strongly regular graph of degree at least 3 and cyclic edge connecti vity at least 3k -3 is 2-extendab Ie. Strongly regular graphs of k even order and of degree k at least 3 with J3 ~"3 are 2-e...

Circuit partitioning is a very extensively studied problem. Our proposed methodology easily extends to multiple constraints that are very dominant in the design of large scale VLSI Systems. In this paper we formulate the problem as a nonlinear program (NLP). The NLP is solved for the objective of minimum cutset size under the constraints of pins, area, and timing. We have tested the unified fra...

Many algorithms for processing probabilistic networks are dependent on the topological properties of the problem's structure. Such algorithms (e.g., clustering, conditioning) are e ective only if the problem has a sparse graph captured by parameters such as tree width and cycle-cutset size. In this paper we initiate a study to determine the potential of structure-based algorithms in real-life a...

Projection analysis methods have been widely used to segment Japanese character strings. However, if adjacent characters have overhanging strokes or a touching point doesn’t correspond to the histogram minimum, the methods are prone to result in errors. In contrast, non-projection analysis methods being proposed for use on numerals or alphabet characters cannot be simply applied for Japanese ch...

A wheel is a graph formed by a chordless cycle C and a vertex u not in C that has at least three neighbors in C. We prove that every 3-connected planar graph that does not contain a wheel as an induced subgraph is either a line graph or has a clique cutset. We prove that every planar graph that does not contain a wheel as an induced subgraph is 3-colorable. AMS classification: 05C75 ∗Partially ...

Let t be a positive real number. A graph is called t-tough, if the removal of any cutset S leaves at most |S|/t components. The toughness of a graph is the largest t for which the graph is t-tough. A graph is minimally t-tough, if the toughness of the graph is t and the deletion of any edge from the graph decreases the toughness. The complexity class DP is the set of all languages that can be e...

In this paper we concentrate on practical aspects of qualitative modeling and reasoning, reporting our experience within the VMBD project 1 in applying Constraint Programming techniques to the task of diagnosing a real-life automotive subsystem. We propose a layered modeling approach: qualitative deviations equations as high level model and Constraint Satisfaction Problems (CSPs) with non binar...

A connected digraph of minimum degree δ is said to be maximally connected if the cardinality of every cutset is al least δ, and it is called superconnected if moreover every minimum disconnecting set F consists of the vertices adjacent to or from a given vertex not belonging to F . Let π be an integer, 0 ≤ π ≤ δ − 2, δ being the minimum degree of the digraph. In this work, we prove that if D ≤ ...

A (k; g)-cage is a graph of minimum order among k-regular graphs with girth g. We show that for every cutset S of a (k; g)-cage G, the induced subgraphG[S] has diameter at least bg/2c, with equality only when distance bg/2c occurs for at least two pairs of vertices in G[S]. This structural property is used to prove that every (k; g)-cage with k ≥ 3 is 3-connected. This result supports the conje...