10618110
Dominating subgraphs in graphs with some forbidden structures
Abstract We characterize the triangle-free graphs with neither induced path of six vertices nor induced cycle of six vertices and the triangle-free graphs without induced path of six vertices in terms of dominating subgraphs.
10016971
Improved bottleneck domination algorithms
W.C.K. Yen introduced BOTTLENECK DOMINATION and BOTTLENECK INDEPENDENT DOMINATION. He presented an O(n log n + m)- time algorithm to compute a minimum bottleneck dominating set. He also obtained that the BOTTLENECK INDEPENDENT DOMINATING SET problem is NP-complete, even when restricted to planar graphs.We present simple linear time algorithms for the BOTTLENECK DOMINATING SET and the BOTTLENECK TOTAL DOMINATING SET problem. Furthermore, we give polynomial time algorithms (most of them with linear time-complexities) for the BOTTLENECK INDEPENDENT DOMINATING SET problem on the following graph classes: AT-free graphs, chordal graphs, split graphs, permutation graphs, graphs of bounded treewidth, and graphs of clique-width at most k with a given k-expression.
35455221
A characterization of pancyclic complements of line graphs
Abstract We characterize graphs G such that the complements of their line graphs are pancyclic.
38589580
A genetic agent-based negotiation system
Abstract Automated negotiation has become increasingly important since the advent of electronic commerce. Nowadays, goods are no longer necessarily traded at a fixed price, and instead buyers and sellers negotiate among themselves to reach a deal that maximizes the payoffs of both parties. In this paper, a genetic agent-based model for bilateral, multi-issue negotiation is studied. The negotiation agent employs genetic algorithms and attempts to learn its opponent's preferences according to the history of the counter-offers based upon stochastic approximation. We also consider two types of agents: level-0 agents are only concerned with their own interest while level-1 agents consider also their opponents' utility. Our goal is to develop an automated negotiator that guides the negotiation process so as to maximize both parties' payoff.
39795223
On the Use of Sender Adaptation to Improve Stability and Fairness for Layered Video Multicast
Layered multicast has been shown as a promising technique for distributing a video program to a potentially large number of heterogeneous receivers. While several layered multicast approaches have been proposed, prior work has almost exclusively focused on improving the perceived video quality in terms of PSNR value or/and the fairness among different receivers. In this paper, we first argue that stability is another major index for the video playback quality; in an extreme case even with the best possible achievable PSNR value, the frequent switching between different layers still can lead to significant quality degradation. We then introduce an end-to-end adaptation framework that improves the stability and fairness for receivers by employing a dynamic layer rate allocation scheme on the sender's side. Specifically, we propose a new metric, called Stability-aware Fairness Index (SFI), which can capture both the stability as well as fairness. We then formulate the optimal layer rate allocation problem with the objective of minimizing the expected SFI for all the receivers in a multicast session, and derive an efficient algorithm to solve the problem. Simulation results demonstrate that our scheme can significantly improve the degree of stability and fairness, thus leading to better video playback quality.
36178651
The vertex linear arboricity of distance graphs
A distance graph is a graph G(R,D) with the set of all points of the real line as vertex set and two vertices u,[email protected]?R are adjacent if and only if |u-v|@?D where the distance set D is a subset of the positive real numbers. Here, the vertex linear arboricity of G(R,D) is determined when D is an interval between 1 and @d. In particular, the vertex linear arboricity of integer distance graphs G(D) is discussed, too.
39794072
Three-Dimensional Effects Created by Macromedia Flash MX
33569862
Survey of Double Vertex Graphs
Abstract. Let G be a (V,E) graph of order p≥2. The double vertex graphU2(G) is the graph whose vertex set consists of all 2-subsets of V such that two distinct vertices {x,y} and {u,v} are adjacent if and only if |{x,y}∩{u,v}|=1 and if x=u, then y and v are adjacent in G. For this class of graphs we discuss the regularity, eulerian, hamiltonian, and bipartite properties of these graphs. A generalization of this concept is n-tuple vertex graphs, defined in a manner similar to double vertex graphs. We also review several recent results for n-tuple vertex graphs.