Results 1  10
of
123,939
Tree Vertex Splitting Problem
"... Utility of random generated graphs to 4:00 pm optimize peertopeer networks ..."
Abstract
 Add to MetaCart
Utility of random generated graphs to 4:00 pm optimize peertopeer networks
Network Centric Warfare: Developing and Leveraging Information Superiority
 Command and Control Research Program (CCRP), US DoD
, 2000
"... the mission of improving DoD’s understanding of the national security implications of the Information Age. Focusing upon improving both the state of the art and the state of the practice of command and control, the CCRP helps DoD take full advantage of the opportunities afforded by emerging technolo ..."
Abstract

Cited by 308 (5 self)
 Add to MetaCart
the mission of improving DoD’s understanding of the national security implications of the Information Age. Focusing upon improving both the state of the art and the state of the practice of command and control, the CCRP helps DoD take full advantage of the opportunities afforded by emerging technologies. The CCRP pursues a broad program of research and analysis in information superiority, information operations, command and control theory, and associated operational concepts that enable us to leverage shared awareness to improve the effectiveness and efficiency of assigned missions. An important aspect of the CCRP program is its ability to serve as a bridge between the operational, technical, analytical, and educational communities. The CCRP provides leadership for the command and control research community by: n n
Vertex cover reconfiguration and beyond
, 2014
"... Abstract. In the Vertex Cover Reconfiguration (VCR) problem, given graph G = (V,E), positive integers k and `, and two vertex covers S and T of G of size at most k, we determine whether S can be transformed into T by a sequence of at most ` vertex additions or removals such that each operation res ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
Abstract. In the Vertex Cover Reconfiguration (VCR) problem, given graph G = (V,E), positive integers k and `, and two vertex covers S and T of G of size at most k, we determine whether S can be transformed into T by a sequence of at most ` vertex additions or removals such that each operation
Feedback Vertex Set in Mixed Graphs
"... Abstract. A mixed graph is a graph with both directed and undirected edges. We present an algorithm for deciding whether a given mixed graph onnvertices contains a feedback vertex set (FVS) of size at mostk, in time47.5 k ·k!·O(n 4). This is the first fixed parameter tractable algorithm for FVS that ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
Abstract. A mixed graph is a graph with both directed and undirected edges. We present an algorithm for deciding whether a given mixed graph onnvertices contains a feedback vertex set (FVS) of size at mostk, in time47.5 k ·k!·O(n 4). This is the first fixed parameter tractable algorithm for FVS
Parameterized Complexity of Vertex Deletion into Perfect Graph Classes
 In Proc. FCT 2011. LNCS
"... Abstract. Vertex deletion problems are at the heart of parameterized complexity. For a graph class F, the FDeletion problem takes as input a graphG and an integer k. The question is whether it is possible to delete at most k vertices from G such that the resulting graph belongs to F. Whether Perfec ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Abstract. Vertex deletion problems are at the heart of parameterized complexity. For a graph class F, the FDeletion problem takes as input a graphG and an integer k. The question is whether it is possible to delete at most k vertices from G such that the resulting graph belongs to F. Whether
Genetic Algorithms for Vertex Splitting in DAGs
, 1993
"... Directed Acyclic Graphs are often used to model circuits and networks. The path length in such Directed Acyclic Graphs represents circuit or network delays. In the vertex splitting problem, the objective is to determine a minimum number of vertices from the graph to split such that the resulting gra ..."
Abstract
 Add to MetaCart
Directed Acyclic Graphs are often used to model circuits and networks. The path length in such Directed Acyclic Graphs represents circuit or network delays. In the vertex splitting problem, the objective is to determine a minimum number of vertices from the graph to split such that the resulting
An Evolutionary Algorithm for Graph Planarisation by Vertex Deletion
"... Abstract: A nonplanar graph can only be planarised if it is structurally modified. This work presents a new heuristic algorithm that uses vertices deletion to modify a nonplanar graph in order to obtain a planar subgraph. The proposed algorithm aims to delete a minimum number of vertices to achiev ..."
Abstract
 Add to MetaCart
to achieve its goal. The vertex deletion number of a graph G = (V,E) is the smallest integer k ≥ 0 such that there is an induced planar subgraph of G obtained by the removal of k vertices of G. Considering that the corresponding decision problem is NPcomplete and an approximation algorithm for graph
Dense Critical and VertexCritical Graphs
, 2001
"... This paper gives new constructions of kchromatic critical graphs with high minimum degree and high edge density, and of vertexcritical graphs with high edge density. ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
This paper gives new constructions of kchromatic critical graphs with high minimum degree and high edge density, and of vertexcritical graphs with high edge density.
Results 1  10
of
123,939