Add to ORKGGeneralization of cliques, odd cycles and anticycles and their relation to independence system polyhedra / R. Euler, M. Jünger and G. Reinelt. - In: Mathematics of operations research. 12. 1987. S. 451-46
The independence and clique polynomial are two types of graph polynomial that store combinatorial in...
In this paper, we present procedures to obtain facet-defining inequalities for the independence syst...
Many fundamental combinatorial optimization problems involve the search for subsets of graph element...
Generalization of cliques, odd cycles and anticycles and their relation to independence system polyh...
Generalization of cliques, odd cycles and anticycles and their relation to independence system polyh...
Generalization of cliques, odd cycles and anticycles and their relation to independence system polyh...
Generalization of cliques, odd cycles and anticycles and their relation to independence system polyh...
Generalizations of cliques, odd cycles and anticycles and their relation to independence system poly...
Generalizations of cliques, odd cycles and anticycles and their relation to independence system poly...
The composition of general bipartite subgraph respectively acyclic subdigraph independence systems a...
AbstractThe composition of general bipartite subgraph respectively acyclic subdigraph independence s...
AbstractBy generalizing matroid axiomatics we provide a framework in which independence systems may ...
AbstractThe composition of general bipartite subgraph respectively acyclic subdigraph independence s...
AbstractThis paper deals with the problem of determining the independence number for the strong grap...
This work was also published as a Rice University thesis/dissertation: http://hdl.handle.net/1911/2...
The independence and clique polynomial are two types of graph polynomial that store combinatorial in...
In this paper, we present procedures to obtain facet-defining inequalities for the independence syst...
Many fundamental combinatorial optimization problems involve the search for subsets of graph element...
Generalization of cliques, odd cycles and anticycles and their relation to independence system polyh...
Generalization of cliques, odd cycles and anticycles and their relation to independence system polyh...
Generalization of cliques, odd cycles and anticycles and their relation to independence system polyh...
Generalization of cliques, odd cycles and anticycles and their relation to independence system polyh...
Generalizations of cliques, odd cycles and anticycles and their relation to independence system poly...
Generalizations of cliques, odd cycles and anticycles and their relation to independence system poly...
The composition of general bipartite subgraph respectively acyclic subdigraph independence systems a...
AbstractThe composition of general bipartite subgraph respectively acyclic subdigraph independence s...
AbstractBy generalizing matroid axiomatics we provide a framework in which independence systems may ...
AbstractThe composition of general bipartite subgraph respectively acyclic subdigraph independence s...
AbstractThis paper deals with the problem of determining the independence number for the strong grap...
This work was also published as a Rice University thesis/dissertation: http://hdl.handle.net/1911/2...
The independence and clique polynomial are two types of graph polynomial that store combinatorial in...
In this paper, we present procedures to obtain facet-defining inequalities for the independence syst...
Many fundamental combinatorial optimization problems involve the search for subsets of graph element...