Over time, a market dialog of taxonomy extension best practices will improve constituent communication and investor analysis and comparability assessments. A stated goal/objective typically associated with the adoption of the Extensible Business Reporting Language (XBRL 1 ) is the enhancement of information quality, specifically comparability. Terms often cited include 'Standard', 'Standardizat...

In this paper we study the 0-1 inverse maximum stable set problem, denoted by IS{0,1}. Given a graph and a stable set (not necessarily maximum), it is to delete a minimum number of vertices to make the given stable set maximum in the new graph. We also consider IS{0,1} against a specific algorithm such as Greedy and 2opt, which is denoted by IS{0,1},greedy and IS{0,1},2opt, respectively. We pro...

The Honey-Bee game is a two-player board game that is played on a connected hexagonal colored grid, or in a generalized setting, on a connected graph with colored nodes. In a single move, a player calls a color and thereby conquers all nodes of that color that are adjacent to his own territory. Both players want to conquer the majority of the nodes. We show that winning the game is PSPACE-hard ...

A cocolouring of a graph G is a partition of the vertices such that each set of the partition induces either a clique or an independent set in G. The cochromatic number of G is the smallest cardinality of a cocolouring of G. We show that the cochromatic number problem remains NP-complete for line graphs of comparability graphs (and hence for line graphs and K,, ,-free graphs), and we present po...

By making use of lexicographic breadth rst search (Lex-BFS) and partition re nement with pivots, we obtain very simple algorithms for some well-known problems in graph theory. We give a O(n + m log n) algorithm for transitive orientation of a comparability graph, and simple linear algorithms to recognize interval graphs, convex graphs, Y -semichordal graphs and matrices that have the consecutiv...

Themaximum independent set problem (MAXIS) on general graphs is known to beNPhard to approximate within a factor of n1−ǫ, for any ǫ > 0. However, there are many “easy” classes of graphs on which the problem can be solved in polynomial time. In this context, an interesting question is that of computing the maximum independent set in a graph that can be expressed as the union of a small number of...

In an edge modi cation problem one has to change the edge set of a given graph as little as possible so as to satisfy a certain property. We prove the NP-hardness of a variety of edge modi cation problems with respect to some well-studied classes of graphs. These include perfect, chordal, chain, comparability, split and asteroidal triple free. We show that some of these problems become polynomi...

Containment and overlap representations of digraphs are studied, with the following results. The interval containment digraphs are the digraphs of Ferrers dimension 2, and the circular-arc containment digraphs are the complements of circular-arc intersection digraphs. A poset is an interval containment poset if and only if its comparability digraph is an interval containment digraph, and a grap...

We examine powers of Hamiltonian paths and cycles as well as Hamiltonian (power) completion problems in several highly structured graph classes. For threshold graphs we give efficient algorithms as well as sufficient and minimax toughness like conditions. For arborescent comparability graphs we have similar results but also show that for one type of completion problem an ‘obvious’ minimax condi...