scientific article; zbMATH DE number 3582190
From MaRDI portal
Publication:4152571
zbMATH Open0374.05041MaRDI QIDQ4152571FDOQ4152571
Authors: James B. Orlin 
Publication date: 1977
Title of this publication is not available (Why is that?)
Extremal problems in graph theory (05C35) Combinatorial aspects of packing and covering (05B40) Graph theory (05C99)
Cited In (99)
- Clique partitions of complements of forests and bounded degree graphs
- Spectral radius and clique partitions of graphs
- Property testing of the Boolean and binary rank
- On biclique decompositions of complete \(t\)-partite graphs
- On the partition and coloring of a graph by cliques
- Block-graph width
- The Minimum Weight In-Tree Cover Problem
- Jump number of two-directional orthogonal ray graphs
- The Complexity of Complexity
- Title not available (Why is that?)
- On clique partitions of split graphs
- Mod/Resc parsimony inference: theory and application
- Decompositions of complete multigraphs related to Hadamard matrices
- Boolean rank of Kronecker products
- Eigenvalues and clique partitions of graphs
- A set coverage problem
- Covering graphs with few complete bipartite subgraphs
- Clique partitions of the cocktail party graph
- On the complete width and edge clique cover problems
- Clique partitions and clique coverings
- Asymptotic values of clique partition numbers
- Edge importance in a network via line graphs and the matrix exponential
- Bounds for the completely positive rank of a symmetric matrix over a tropical semiring
- On the geometric interpretation of the nonnegative rank
- Parameterized low-rank binary matrix approximation
- Known Algorithms for Edge Clique Cover are Probably Optimal
- Factoring a band matrix over a semiring
- Achieving distributed control through model checking
- Clique covering and clique partition in generalizations of line graphs
- Редукция графа при поиске реберного покрытия минимальным числом клик
- Generalized k-tuple colorings of cycles and other graphs
- A clique covering MIP model for the irregular strip packing problem
- Rank one preservers between spaces of Boolean matrices
- On a clique covering problem of Orlin
- On minimally non-firm binary matrices
- Boolean-rank-preserving operators and Boolean-rank-1 spaces
- On a symmetric representation of Hermitian matrices and its applications to graph theory
- Edge-clique covers of the tensor product
- On the boolean minimal realization problem in the max-plus algebra
- Bijective linear maps on semimodules spanned by Boolean matrices of fixed rank
- Biclique coverings of regular bigraphs and minimum semiring ranks of regular matrices
- On the Computation of the Competition Number of a Graph
- Clustering with Partial Information
- Edge clique covering sum of graphs
- String execution time for finite languages: max is easy, min is hard
- On the kernel size of clique cover reductions for random intersection graphs
- Title not available (Why is that?)
- Hardness results for covering arrays avoiding forbidden edges and error-locating arrays
- On the number of distinct minimal clique partitions and clique covers of a line graph
- On dimensional properties of graphs
- Edge cover by connected bipartite subgraphs
- A generalization of the Bollobás set pairs inequality
- Phylogeny numbers
- Covering arrays avoiding forbidden edges
- Clique coverings and partitions of line graphs
- Applications of edge coverings by cliques
- Sequential Relational Decomposition
- Clique Cover and Graph Separation
- Inertia and biclique decompositions of joins of graphs
- A characterization of competition graphs of arbitrary digraphs
- Minimum-rank and maximum-nullity of graphs and their linear preservers
- Biclique completion problems for multicast network design
- On the complexity of cover-incomparability graphs of posets
- A Combinatorial Approach for Small and Strong Formulations of Disjunctive Constraints
- The Nonnegative Rank of a Matrix: Hard Problems, Easy Solutions
- ON AN INVARIANT FOR THE PROBLEM OF UNDERDETERMINED DATA DECOMPOSING
- Title not available (Why is that?)
- An overview of graph covering and partitioning
- Title not available (Why is that?)
- Hardness and structural results for half-squares of restricted tree convex bipartite graphs
- Efficient approximation for restricted biclique cover problems
- A linear programming formulation for the maximum complete multipartite subgraph problem
- Walk-preserving transformation of overlapped sequence graphs into blunt sequence graphs with GetBlunted
- Factorizing Boolean matrices using formal concepts and iterative usage of essential entries
- Regarding two conjectures on clique and biclique partitions
- Edge clique partition in \((k,\ell)\)-graphs
- Fast constructive and improvement heuristics for edge clique covering
- On the complexity of directed intersection representation of DAGs
- Large-scale clique cover of real-world networks
- On the intractability landscape of digraph intersection representations
- Sharp bounds on the least eigenvalue of a graph determined from edge clique partitions
- More on deterministic and nondeterministic finite cover automata
- Independent sets and hitting sets of bicolored rectangular families
- Covering Graphs with Few Complete Bipartite Subgraphs
- Upper bounds on the Boolean rank of Kronecker products
- Uniform-scale assessment of role minimization in bipartite networks and its application to access control
- Clustering with partial information
- Coloring temporal graphs
- Elements of Fuzzy Logic in Solving Clustering Problems
- Circulant almost cross intersecting families
- On the triangle clique cover and \(K_t\) clique cover problems
- On Blocky Ranks Of Matrices
- Title not available (Why is that?)
- On two variants of split graphs: 2-unipolar graph and \(k\)-probe-split graph
- Good characterizations and linear time recognition for 2-probe block graphs
- On some FPT problems without polynomial Turing compressions
- The Boolean rank of the uniform intersection matrix and a family of its submatrices
- Modeling combinatorial disjunctive constraints via junction trees
- Title not available (Why is that?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4152571)
