Approximation algorithms for the maximum induced planar and outerplanar subgraph problems.
Morgan, Kerri, Farr, Graham (2007)
Journal of Graph Algorithms and Applications
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Parallel Algorithms for Maximal Cliques in Circle Graphs and Unrestricted Depth Search”
Approximation algorithms for the maximum induced planar and outerplanar subgraph problems.
Fast approximation of centrality.
Eppstein, David, Wang, Joseph (2004)
Journal of Graph Algorithms and Applications
Similarity:
Small maximal independent sets and faster exact graph coloring.
Eppstein, David (2003)
Journal of Graph Algorithms and Applications
Similarity:
A relation between the approximated versions of minimum set covering, minimum vertex covering and maximum independent set
V. Th. Paschos (1994)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
An exact performance bound for an time greedy matching procedure.
Shapira, Andrew (1997)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
I/O-optimal algorithms for outerplanar graphs.
Maheshwari, Anil, Zeh, Norbert (2004)
Journal of Graph Algorithms and Applications
Similarity:
A fast multi-scale method for drawing large graphs.
Harel, David, Koren, Yehuda (2002)
Journal of Graph Algorithms and Applications
Similarity:
Satisfiability and matchings in bipartite graphs: relationship and tractability.
Belaid Benhamou (2004)
RACSAM
Similarity:
Satisfiability problem is the task to establish either a given CNF logical formula admits a model or not. It is known to be the canonical NP-complete problem. We study in this note the relationship between matchings in bipartite graphs and the satisfiability problem, and prove that some restrictions of formulae including the known r-r-SAT class are trivially satisfiable. We present an algorithm which finds a model for such formulas in polynomial time complexity if one exists or, failing...
On-Line Computation and Maximum-Weighted Hereditary Subgraph Problems
Marc Demange, Bernard Kouakou, Eric Soutif (2011)
The Yugoslav Journal of Operations Research
Similarity:
A comparison of three algorithms for reducing the profile of a sparse matrix
Alain Billionnet, Jean-François Brêteau (1989)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
On-line models and algorithms for max independent set
Bruno Escoffier, Vangelis Th. Paschos (2006)
RAIRO - Operations Research
Similarity:
In on-line computation, the instance of the problem dealt is not entirely known from the beginning of the solution process, but it is revealed step-by-step. In this paper we deal with on-line independent set. On-line models studied until now for this problem suppose that the input graph is initially empty and revealed either vertex-by-vertex, or cluster-by-cluster. Here we present a new on-line model quite different to the ones already studied. It assumes that a superset of the final...
GRIP: Graph drawing with intelligent placement.
Gajer, Pawel, Kobourov, Stephen G. (2002)
Journal of Graph Algorithms and Applications
Similarity:
The star clustering algorithm for static and dynamic information organization.
Aslam, Javed A., Pelekhov, Ekaterina, Rus, Daniela (2004)
Journal of Graph Algorithms and Applications
Similarity: