Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth

We consider the multivariate interlace polynomial introduced by Courcelle (2008), which generalizes several interlace polynomials defined by Arratia, Bollobas, and Sorkin (2004) and by Aigner and van der Holst (2004). We present an algorithm to evaluate the multivariate interlace polynomial of a graph with n vertices given a tree decomposition of the graph of width k. The best previously known result (Courcelle 2008) employs a general logical framework and leads to an algorithm with running time f(k)*n, where f(k) is doubly exponential in k. Analyzing the GF(2)-rank of adjacency matrices in the context of tree decompositions, we give a faster and more direct algorithm. Our algorithm uses 2^{3k^2+O(k)}*n arithmetic operations and can be efficiently implemented in parallel.Comment: v4: Minor error in Lemma 5.5 fixed, Section 6.6 added, minor improvements. 44 pages, 14 figure

Development of an airline revenue capability model for aircraft design

Typically value based approaches to the design of civil and commercial aircraft, be they net present value, surplus value, or any other utility based approach focus solely on the difference in cost between the alternatives, neglecting changes in revenue which might occur between the two concepts. Alternatively, if they do have a revenue focus, it is based upon simple relationships between payload capacity and revenue, assuming a either a fixed protfimargin or fixed yield. This approach works well when comparing two similar or closely related concepts, but falls apart when investigating more radically di erent systems, e.g. a cruise eficient short take-o and landing concept. By using a value based approach it is relatively simple to structure a decision model to incorporate changing revenue capability. However, the ability to investigate differences in design is very much dependent upon the revenue model and assumptions that are made. If the revenue elasticity is the same forthe two concepts then there is no benefi t in using a variable revenue approach. However, in the cases where the elasticity is different, the revenue approach offers the potential to more properly investigate some fundamentally different alternative concepts. © 2010 by Peter Sutcliffe & Peter Hollingsworth. Published by the American Institute of Aeronautics and Astronautics, Inc

Parameterized Edge Hamiltonicity

We study the parameterized complexity of the classical Edge Hamiltonian Path problem and give several fixed-parameter tractability results. First, we settle an open question of Demaine et al. by showing that Edge Hamiltonian Path is FPT parameterized by vertex cover, and that it also admits a cubic kernel. We then show fixed-parameter tractability even for a generalization of the problem to arbitrary hypergraphs, parameterized by the size of a (supplied) hitting set. We also consider the problem parameterized by treewidth or clique-width. Surprisingly, we show that the problem is FPT for both of these standard parameters, in contrast to its vertex version, which is W-hard for clique-width. Our technique, which may be of independent interest, relies on a structural characterization of clique-width in terms of treewidth and complete bipartite subgraphs due to Gurski and Wanke

B2B e-marketplaces in the airline industry:process drivers and performance indicators

Competitive pressures are increasing within and between different strategically oriented groups of airlines. This paper focuses on the level of efficiency improvements gained by using e-Marketplaces in the procurement process. Findings from a survey among 88 international airlines reveal that the use of Business-to-Business (B2B) e-Marketplaces does play different roles across the various airline groupings. Airlines that are involved in strategic alliances show higher joint procurement activities than airlines that are not involved in strategic alliances. However, alliances are probably viewed as loose arrangements and thus airlines may be reluctant to share information on procurement prices and processes with another airline that could also be acting as a competitor. The financial involvement in or initiation of e-Marketplaces by airlines is very low. Low cost airlines show high use of e-Marketplaces, but demonstrate little financial involvement in contrast. Overall, the categories of spares and repairs, office supplies, tools and ground support equipment (GSE) show the greatest potential for reducing costs and increasing procurement process efficiencies. The intense competitive pressures facing carriers will make their search for tools to realise even incremental savings and efficiency gains ever more urgent. There is evidence that e-Marketplaces are one tool to improve such performance indicators

Using Web Search Query Data to Monitor Dengue Epidemics: A New Model for Neglected Tropical Disease Surveillance

A variety of obstacles, including bureaucracy and lack of resources, delay detection and reporting of dengue and exist in many countries where the disease is a major public health threat. Surveillance efforts have turned to modern data sources such as Internet usage data. People often seek health-related information online and it has been found that the frequency of, for example, influenza-related web searches as a whole rises as the number of people sick with influenza rises. Tools have been developed to help track influenza epidemics by finding patterns in certain web search activity. However, few have evaluated whether this approach would also be effective for other diseases, especially those that affect many people, that have severe consequences, or for which there is no vaccine. In this study, we found that aggregated, anonymized Google search query data were also capable of tracking dengue activity in Bolivia, Brazil, India, Indonesia and Singapore. Whereas traditional dengue data from official sources are often not available until after a long delay, web search query data is available for analysis within a day. Therefore, because it could potentially provide earlier warnings, these data represent a valuable complement to traditional dengue surveillance

A SAT Approach to Clique-Width

Clique-width is a graph invariant that has been widely studied in combinatorics and computer science. However, computing the clique-width of a graph is an intricate problem, the exact clique-width is not known even for very small graphs. We present a new method for computing the clique-width of graphs based on an encoding to propositional satisfiability (SAT) which is then evaluated by a SAT solver. Our encoding is based on a reformulation of clique-width in terms of partitions that utilizes an efficient encoding of cardinality constraints. Our SAT-based method is the first to discover the exact clique-width of various small graphs, including famous graphs from the literature as well as random graphs of various density. With our method we determined the smallest graphs that require a small pre-described clique-width.Comment: proofs in section 3 updated, results remain unchange