207859527
L(p, q)-labelling of K4-minor free graphs
41218825
Relaxed game chromatic number of graphs
This paper discusses a coloring game on graphs. Let k, d be non-negative integers and C a set of k colors. Two persons, Alice and Bob, alternately color the vertices of G with colors from C, with Alice having the first move. A color i is legal for an uncolored vertex x if by coloring x with color i, the subgraph of G induced by those vertices of color i has maximum degree at most d. Each move of Alice or Bob colors an uncolored vertex with a legal color. The game is over if either all vertices are colored, or no more vertices can be colored with a legal color. Alice's goal is to produce a legal coloring which colors all the vertices of G, and Bob's goal is to prevent this from happening. We shall prove that if G is a forest, then for k = 3, d ≥ 1, Alice has a winning strategy. If G is an outerplanar graph, then for k = 6 and d ≥ 1, Alice has a winning strategy.
13354529
Edge-pancyclicity of coupled graphs
The coupled graph c(G) of a plane graph G is the graph defined on the vertex set V(G)∪F(G) so that two vertices in c(G) are joined by an edge if and only if they are adjacent or incident in G. We prove that the coupled graph of a 2-connected plane graph is edge-pancyclic. However, there exists a 2-edge-connected plane graph G such that c(G) is not Hamiltonian.
9810371
The edge-face choosability of plane graphs
A plane graph G is said to be k-edge-face choosable if, for every list L of colors satisfying |L(x)|=k for every edge and face x, there exists a coloring which assigns to each edge and each face a color from its list so that any adjacent or incident elements receive different colors. We prove that every plane graph G with maximum degree Δ(G) is (Δ(G)+3)-edge-face choosable.
1003852
Upper Bounds of Entire Chromatic Number of Plane Graphs
The entire chromatic number χvef (G) of a plane graph G is the least number of colors assigned to the vertices, edges and faces so that every two adjacent or incident pair of them receive different colors. Kronk and Mitchem (1973) conjectured that χvef (G) ≤ 1 + 4 for every plane graph G. In this paper we prove the conjecture for a plane graph G having χ ′(G) = 1 and give a upper bound χvef (G) ≤ 1+ 5 for all plane graphs, where χ ′(G) and 1 are the chromatic index and the maximum degree of G, respectively.
6853966
Total chromatic number of planar graphs with maximum degree ten
1857380
Mining RNA Tertiary Motifs with Structure Graphs
We present a novel application of graph database mining to identify tertiary motifs in RNA structures. In our method, we abstract an RNA molecule as a labeled graph and use a frequent subgraph mining technique to derive tertiary motifs. By applying our technique to ribosome RNA and transfer RNA, we have identified known RNA tertiary motifs such as the ribose zipper and U-turn, plus candidates for novel tertiary motifs. Finally, we suggest an iterative multiple structure alignment algorithm to classify tertiary motifs and generate consensus motifs.
38145479
Pre-scheduling on the domain of integers
A preschedule is a static schedule without assuming constant and completely predictable rate of resource supply. A generalized prescheduling framework and a sound, complete, and PTIME preschedule generator was proposed in Wang et al. (2004) based on linear programming (LP). Since infinitely small time slices are not implementable for resources with context switch overhead, it is desirable to define and solve the prescheduling problem on the domain of integers so that context switching can occur only at boundaries of time quantums. However, integral LP (ILP) is NP-hard in the strong sense in general, so the ILP approach is not applicable and better techniques are needed. This paper answers this challenge by giving a sound, complete and PTIME rational-to-integral preschedule transformer based on a technique which we call "round-and-compensate".
5616933
Techniques for effective vocabulary selection
The vocabulary of a continuous speech recognition (CSR) system is a significant factor in determining its performance. In this paper, we present three principled approaches to select the target vocabulary for a particular domain by trading off between the target out-of-vocabulary (OOV) rate and vocabulary size. We evaluate these approaches against an ad-hoc baseline strategy. Results are presented in the form of OOV rate graphs plotted against increasing vocabulary size for each technique.
14374205
Understanding Social Welfare Service Patterns Using Sequential Analysis
Classical exploratory data analysis methods in statistics and many of the earlier KDD methods tend to focus only on basic data types, (interval or categorical data) as the unit of analysis. However, some information cannot be interpreted unless the data is treated as a unit. For example, viewing the data as sequences of sets can reveal useful information that could not be extracted in any other way. Analyzing suitable databases from such a perspective can assist many social scientists in their work.
15982467
On intrinsic representations of 3D polygons for shape blending
Abstract An intrinsic representation of a geometric object comprises a set of parameters that are invariant under Euclidean transformations and determine the shape and size of the object uniquely. Unlike the case of a two-dimensional polygon which has essentially only one intrinsic representation, a three-dimensional (3D) polygon allows several variations. We study three different intrinsic representations of a 3D polygon, focusing on properties regarding their applications in shape blending. We show that only one of these representations, which is a natural extension to the intrinsic functions of a 3D differentiable curve, is suitable for shape blending, while the others lead to discontinuous shape transformation. Detailed discussions about the evaluation criteria, numerical sensitivity, and an inherent difficulty in shape blending of 3D polygons are also presented.