Results 241 to 250 of about 6,576,413 (265)
Some of the next articles are maybe not open access.

Cuts and Induced Bipartite Subgraphs

2017
In this chapter we compare three popular models for the maximum cut problem and show the equivalence of their relaxations by using compact extended formulations. These problems are closely related to the subject of edge-induced and node-induced bipartite subgraphs, for which we give compact extended formulations as well.
Lancia G., Serafini P.
openaire   +2 more sources

Definability of Recursive Predicates in the Induced Subgraph Order

Indian Conference on Logic and Its Applications, 2017
R. Thinniyam
semanticscholar   +1 more source

Top-k frequent induced subgraph mining using sampling

International Conference on Emerging Databases, 2016
Van T. T. Duong   +3 more
semanticscholar   +1 more source

Obstructions for three-coloring graphs with one forbidden induced subgraph

ACM-SIAM Symposium on Discrete Algorithms, 2016
M. Chudnovsky   +3 more
semanticscholar   +1 more source

Solving the Induced Subgraph Problem in the Randomized Multiparty Simultaneous Messages Model

Colloquium on Structural Information & Communication Complexity, 2015
J. Kari   +3 more
semanticscholar   +1 more source

Induced Subgraph Isomorphism on proper interval and bipartite permutation graphs

Theoretical Computer Science, 2015
P. Heggernes   +3 more
semanticscholar   +1 more source

Boundary graph classes for some maximum induced subgraph problems

Journal of combinatorial optimization, 2014
D. Malyshev
semanticscholar   +1 more source

Algorithms for the Maximum Weight Connected k -Induced Subgraph Problem

International Conference on Combinatorial Optimization and Applications, 2014
Ernst Althaus   +4 more
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy