Results 1  10
of
386
Improved Exact Exponential Algorithms for Vertex Bipartization and Other Problems
"... 1 We study efficient exact algorithms for several problems including VERTEX BIPARTIZATION, FEEDBACK VERTEX SET, 4HITTING SET, MAX CUT in graphs with maximum degree at most 4. Our main results include: • an O ∗ (1.9526 n) 2 algorithm for VERTEX BIPARTIZATION problem in undirected graphs; • an O ∗ (1 ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
1 We study efficient exact algorithms for several problems including VERTEX BIPARTIZATION, FEEDBACK VERTEX SET, 4HITTING SET, MAX CUT in graphs with maximum degree at most 4. Our main results include: • an O ∗ (1.9526 n) 2 algorithm for VERTEX BIPARTIZATION problem in undirected graphs; • an O
CompressionBased FixedParameter Algorithms for Feedback Vertex Set and Edge Bipartization
, 2006
"... We show that the NPcomplete Feedback Vertex Set problem, which asks for the smallest set of vertices to remove from a graph to destroy all cycles, is deterministically solvable in O(c k ·m) time. Here, m denotes the number of graph edges, k denotes the size of the feedback vertex set searched for, ..."
Abstract

Cited by 47 (4 self)
 Add to MetaCart
, and c is a constant. We extend this to an algorithm enumerating all solutions in O(d k ·m) time for a (larger) constant d. As a further result, we present a fixedparameter algorithm with runtime O(2 k · m 2) for the NPcomplete Edge Bipartization problem, which asks for at most k edges to remove from a
Bipartizing fullerenes
"... A fullerene graph is a cubic bridgeless planar graph with twelve 5faces such that all other faces are 6faces. We show that any fullerene graph on n vertices can be bipartized by removing O (√n) edges. This bound is asymptotically optimal. ..."
Abstract
 Add to MetaCart
A fullerene graph is a cubic bridgeless planar graph with twelve 5faces such that all other faces are 6faces. We show that any fullerene graph on n vertices can be bipartized by removing O (√n) edges. This bound is asymptotically optimal.
Bipartizing fullerenes
, 2012
"... A fullerene graph is a cubic bridgeless planar graph with twelve 5faces such that all other faces are 6faces. We show that any fullerene graph on n vertices can be bipartized by removing O( n) edges. This bound is asymptotically optimal. ..."
Abstract
 Add to MetaCart
A fullerene graph is a cubic bridgeless planar graph with twelve 5faces such that all other faces are 6faces. We show that any fullerene graph on n vertices can be bipartized by removing O( n) edges. This bound is asymptotically optimal.
Improved FixedParameter Algorithms for Two Feedback Set Problems
 In Proc. 9th WADS, volume 3608 of LNCS
, 2005
"... Abstract. Settling a ten years open question, we show that the NPcomplete Feedback Vertex Set problem is deterministically solvable in O(c k ·m) time, where m denotes the number of graph edges, k denotes the size of the feedback vertex set searched for, and c is a constant. As a second result, we pr ..."
Abstract

Cited by 17 (3 self)
 Add to MetaCart
present a fixedparameter algorithm for the NPcomplete Edge Bipartization problem with runtime O(2 k · m 2). 1
Exponential Time Algorithms: Structures, Measures, and Bounds
, 2008
"... This thesis studies exponential time algorithms, more precisely, algorithms exactly solving problems for which no polynomial time algorithm is known and likely to exist. Interested in worst–case upper bounds on the running times, several known techniques to design and analyze such algorithms are sur ..."
Abstract

Cited by 11 (7 self)
 Add to MetaCart
This thesis studies exponential time algorithms, more precisely, algorithms exactly solving problems for which no polynomial time algorithm is known and likely to exist. Interested in worst–case upper bounds on the running times, several known techniques to design and analyze such algorithms
Planar Embedding of Hamiltonian Graphs Via Efficient Bipartation of Circle Graphs
, 1994
"... We describe an easy way to check whether a hamiltonian graph of order n with a given hamiltonian cycle is planar. This is done by solving the bipartation problem for the corresponding circle graph. If the graph is planar an embedding is constructed. The algorithm runs in O(n) time and space. 1 Intro ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We describe an easy way to check whether a hamiltonian graph of order n with a given hamiltonian cycle is planar. This is done by solving the bipartation problem for the corresponding circle graph. If the graph is planar an embedding is constructed. The algorithm runs in O(n) time and space. 1
Characterization of complex networks: A survey of measurements
 ADVANCES IN PHYSICS
, 2005
"... Each complex network (or class of networks) presents specific topological features which characterize its connectivity and highly influence the dynamics and function of processes executed on the network. The analysis, discrimination, and synthesis of complex networks therefore rely on the use of mea ..."
Abstract

Cited by 200 (17 self)
 Add to MetaCart
Each complex network (or class of networks) presents specific topological features which characterize its connectivity and highly influence the dynamics and function of processes executed on the network. The analysis, discrimination, and synthesis of complex networks therefore rely on the use of measurements capable of expressing the most relevant topological features. This article presents a survey of such measurements. It includes general considerations about complex network characterization, a brief review of the principal models, and the presentation of the main existing measurements organized into classes. Special attention is given to relating complex network analysis with the areas of pattern recognition and feature selection, as well as on surveying some concepts and measurements from traditional graph theory which are potentially useful for complex network research. Depending on the network and the analysis task one has in mind, a specific set of features may be chosen. It is hoped that the present survey will help the
Results 1  10
of
386