No abstract

So far, many user interfaces for XML data (documents) have been constructed from scratch for specific XML vocabularies and applications. The tool support for user interfaces for XML data is inadequate. Forms-XML is an interactive component invoked by applications for generating user interfaces for prescribed XML vocabularies automatically. Based on a given XML schema, the component generates a hierarchy of HTML forms for users to interact with and update XML data compliant with the given schema. The user interface Forms-XML generates is very simple with an abundance of guidance and hints to the user, and can be customized by user interface designers as well as developers.

We consider the real-weight maximum cut of a planar graph. Given an undirected planar graph with real-valued weights associated with its edges, find a partition of the vertices into two nonemply sets such that the sum of the weights of the edges connecting the two sets is maximum. The conventional maximum cut and minimum cut problems assume nonnegative edge weights, and thus are special cases of the real-weight maximum cut. We develop an O(n3I2 logn) algorithm for finding a real-weight maximum cut of a planar graph where n is the number of vertices in the graph. The best maximum cut algorithm previously known for planar graphs has the running time of O (n 3) .

The problem of compacting a programmable logic array is formulated as the following graph problem. Given a red-edge bipartite graph, how to add maximum number of independent green edges such that there are no cycles formed by alternating red and green edges. For this NP-complete problem, we present a polynomial heuristic algorithm which gives an optimum solution when the red bipartite graph satisfies certain conditions, e.g., a tree. When the bipartite graph does not satisfy these conditions, the heuristic algorithm gives a solution with worst-case error bound. For a red bipartite graph with given cardinality, we give a tight upper bound on the number of green edges.

No abstract