Results 1  10
of
175
Lower Bounds for Online Graph Problems with Application to Online Circuit and Optical Routing
, 1996
"... We present lower bounds on the competitive ratio of randomized algorithms for a wide class of online graph optimization problems and we apply such results to online virtual circuit and optical routing problems. Lund and Yannakakis [LY93a] give inapproximability results for the problem of finding t ..."
Abstract

Cited by 45 (8 self)
 Add to MetaCart
the largest vertex induced subgraph satisfying any nontrivial, hereditary, property . E.g., independent set, planar, acyclic, bipartite, etc. We consider the online version of this family of problems, where some graph G is fixed and some subgraph H is presented online, vertex by vertex. The online
REDUCING OFFLINE TO ONLINE: AN EXAMPLE AND ITS APPLICATIONS
"... Abstract: We study online versions of maximum weighted hereditary subgraph problems for which the instance is revealed in two clusters. We focus on the comparison of these online problems with their respective offline versions. In [3], we have reduced online versions to the offline ones in orde ..."
Abstract
 Add to MetaCart
Abstract: We study online versions of maximum weighted hereditary subgraph problems for which the instance is revealed in two clusters. We focus on the comparison of these online problems with their respective offline versions. In [3], we have reduced online versions to the offline ones
Parameterized Complexity of Finding Subgraphs with Hereditary Properties
, 2002
"... We consider the parameterized complexity of the following problem under the flamework introduced by Downey and Fellows[4]: Given a graph G, an integer parmneter : and a nontrivial hereditary property H, are there vertices of G that induce a subgraph with property H? This problem has been proved ..."
Abstract

Cited by 32 (6 self)
 Add to MetaCart
We consider the parameterized complexity of the following problem under the flamework introduced by Downey and Fellows[4]: Given a graph G, an integer parmneter : and a nontrivial hereditary property H, are there vertices of G that induce a subgraph with property H? This problem has been
Generating all maximal induced subgraphs for hereditary and connectedhereditary graph properties
 J. Comput. Syst. Sci
"... The problem of computing all maximal induced subgraphs of a graph G that have a graph property P, also called the maximal Psubgraphs problem, is considered. This problem is studied for hereditary, connectedhereditary and rootedhereditary graph properties. The maximal Psubgraphs problem is reduce ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
The problem of computing all maximal induced subgraphs of a graph G that have a graph property P, also called the maximal Psubgraphs problem, is considered. This problem is studied for hereditary, connectedhereditary and rootedhereditary graph properties. The maximal Psubgraphs problem
On the Ordered List Subgraph Embedding Problems
"... Abstract. In the (parameterized) Ordered List Subgraph Embedding problem (pOLSE) we are given two graphs G and H, each with a linear order defined on its vertices, a function L that associates with every vertex in G a list of vertices in H, and a parameter k. The question is to decide if we can emb ..."
Abstract
 Add to MetaCart
between their images. If we require the subgraph S to be embedded as an induced subgraph, we obtain the Ordered List Induced Subgraph Embedding problem (pOLISE). The pOLSE and pOLISE problems model various problems in Bioinformatics related to structural comparison/alignment of proteins. We investigate
Forbidden Induced Subgraph Characterization of Cograph Contraction
 J. GRAPH THEORY
, 2001
"... We solve the problem of characterization of cograph contraction. Let P be a hereditary class proposed by Le [2]. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We solve the problem of characterization of cograph contraction. Let P be a hereditary class proposed by Le [2].
Selfdetermination and persistence in a reallife setting: Toward a motivational model of high school dropout.
 Journal of Personality and Social Psychology,
, 1997
"... The purpose of this study was to propose and test a motivational model of high school dropout. The model posits that teachers, parents, and the school administration's behaviors toward students influence students' perceptions of competence and autonomy. The less autonomy supportive the so ..."
Abstract

Cited by 183 (19 self)
 Add to MetaCart
to support the model for all participants and for each gender separately. High school dropout represents an important problem that affects thousands of students each year. Roughly one third of all students will drop out of high school without having received their high school diplomas, both in Canada (Canada
The NodeDeletion Problem for Hereditary . . .
, 1980
"... We consider the family of graph problems called nodedeletion problems, defined as follows: For a fixed graph property l7, what is the minimum number of nodes which must be deleted from a given graph so that the resulting subgraph satisfies l7? We show that if l7 is nontrivial and hereditary on indu ..."
Abstract
 Add to MetaCart
We consider the family of graph problems called nodedeletion problems, defined as follows: For a fixed graph property l7, what is the minimum number of nodes which must be deleted from a given graph so that the resulting subgraph satisfies l7? We show that if l7 is nontrivial and hereditary
S.: Parameterized complexity of the induced subgraph problem in directed graphs
 Inf. Process. Lett
, 2007
"... Abstract In this paper, we consider the parameterized complexity of the following problem: Given a hereditary property P on digraphs, an input digraph D and a positive integer k, does D have an induced subdigraph on k vertices with property P? We completely characterize hereditary properties for wh ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract In this paper, we consider the parameterized complexity of the following problem: Given a hereditary property P on digraphs, an input digraph D and a positive integer k, does D have an induced subdigraph on k vertices with property P? We completely characterize hereditary properties
Results 1  10
of
175