scientific article; zbMATH DE number 5543290
From MaRDI portal
Publication:3620683
Recommendations
- A linear algorithm for computing the multiclique cover number of a series-parallel graph
- scientific article; zbMATH DE number 5863491
- Algorithms for finding biclique covers of graphs with bounded pathwidth
- A linear algorithm for computing \(\gamma_{[1,2]}\)-set in generalized series-parallel graphs
- scientific article; zbMATH DE number 3910441
- A Linear Algorithm for Edge-Coloring Series–Parallel Multigraphs
- On the parameterized complexity of biclique cover and partition
- On finding a minimum vertex cover of a series-parallel graph
- A linear time algorithm for determining almost bipartite graphs
- scientific article; zbMATH DE number 4049086
Cited in
(11)- Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs
- Biclique cover and local clique cover of graphs
- Chromatic characterization of biclique covers
- Algorithms for finding biclique covers of graphs with bounded pathwidth
- scientific article; zbMATH DE number 5863491 (Why is no real title available?)
- A linear algorithm for computing the multiclique cover number of a series-parallel graph
- Computation of the biclique partition number for graphs with specific blocks
- On biclique covering number of the Cartesian product of graphs
- Problems and invariants connected with bicliques and multicliques of graphs
- The complexity for the problems of covering of a graph with the minimum number of complete bipartite subgraphs
- Finding biclique partitions of co-chordal graphs
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 Q3620683)
