670153
Domination in distance-hereditary graphs
The domination problem and its variants have been extensively studied in the literature. In this paper we investigate the domination problem in distance-hereditary graphs. In particular, we give a linear-time algorithm for the domination problem in distance-hereditary graphs by a labeling approach. We actually solve a more general problem, called the L-domination problem, which also includes the total domination problem as a special case.
16598523
Algorithmic Aspects of the Generalized Clique-transversal Problem on Chordal Graphs
Suppose G = (V, E) is a graph in which each maximal clique Ci is associated with an integer ri, where 0 ⩽ ri ⩽ ¦Ci¦. The generalized clique transversal problem is to determine the minimum cardinality of a subset D of V such that ¦D ∩ Ci¦ ⩾ ri for every maximal clique Ci of G. The problem includes the clique-transversal problem, the i, 1 clique-cover problem, and for perfect graphs, the maximum q-colorable subgraph problems as special cases. This paper gives complexity results for the problem on subclasses of chordal graphs, e.g., strongly chordal graphs, k-trees, split graphs, and undirected path graphs.
45586323
Prediction of Internet and World Wide Web usage at work: a test of an extended Triandis model
Abstract The Internet/World Wide Web (WWW) has significantly impacted every facet of operations in organizations. As information systems, including Decision Support Systems, are rapidly moving to the Internet platform to facilitate remote access and group cooperation, it is crucial to understand the adoption process of the Internet. This paper studies various factors affecting Internet/WWW usage in working environments. Previous studies on Internet or WWW usage have adopted the Technology Acceptance Model (TAM) as their research framework. As such, important factors, such as facilitating conditions and social factors, which we consider important in explaining the use of the Internet/WWW, were left out. Therefore, a more comprehensive theoretical model is constructed for this study by modifying the Triandis social psychological model based on the results of previous studies. Factor analysis and multiple regression were used to analyze data collected from 241 questionnaires. The results support our modified model. Facilitating conditions and social factors are confirmed as the two most important factors affecting Internet/WWW usage. Other significant factors include perceived near-term consequences and perceived complexity. All new paths that we have added to the original Triandis model are found to be significant. The proposed model should provide a valuable alternative theoretical basis for technology adoption studies in the future.
10053237
Automated least-significant bit datapath optimization for FPGAs
In this paper, we present a method for FPGA datapath precision optimization subject to user-defined area and error constraints. This work builds upon our previous research which presented a methodology for optimizing the dynamic range- the most significant bit position. In this work, we present an automated optimization technique for the least-significant bit position of circuit datapaths. We present results describing the effectiveness of our methods on typical signal and image processing kernels.
6580714
Optimal Diagnosis Procedures for k-out-of-n Structures
Diagnosis strategies are investigated for repairable VLSI and WSI structures based on integrated diagnosis and repair. Knowledge of the repair strategy, the probability of each unit being good, and the expected test time of each unit is used by the diagnosis algorithm to select units for testing. The general problem is described, followed by an examination of a specific case. For k-out-of-n structures, a complete proof is given for the optimal diagnosis procedure of Y. Ben-Dov (1981). A compact representation of the optimal diagnosis procedure is described, which requires O(n/sup 2/) space and can be generated in O(n/sup 2/) time. Simulation results are provided to show the improvement in diagnosis time over online repair and offline repair. >
6381363
Weighted Domination of Cocomparability Graphs
It is shown in this paper that the weighted domination problem and its two variants, the weighted connected domination and weighted total domination problems are NP-complete on cocomparability graphs when arbitrary integer vertex weights are allowed and all of them can be solved in polynomial time if vertex weights are integers and less than or equal to a constant c. Besides, an O(¦V¦2) algorithm is given for the weighted independent perfect domination problem of a cocomparability graph G=(V, E).
36993971
Distance-hereditary graphs are clique-perfect
In this paper, we show that the clique-transversal number @t"C(G) and the clique-independence number @a"C(G) are equal for any distance-hereditary graph G. As a byproduct of proving that @t"C(G)[email protected]"C(G), we give a linear-time algorithm to find a minimum clique-transversal set and a maximum clique-independent set simultaneously for distance-hereditary graphs.