Name
Abstract | ||
|---|---|---|
In this paper we give a recognition algorithm in O(n(n + m)) time for bipartite chain graphs, and directly calculate the density of such graphs. For their stability number and domination number, we give algorithms comparable to the existing ones. We point out some applications of bipartite chain graphs in chemistry and approach the Minimum Chain Completion problem. |
Year | Venue | Keywords |
|---|---|---|
2013 | COMPUTING AND INFORMATICS | Bipartite chain graphs,weakly decomposition,recognition algorithms,combinatorial optimization algorithms |
Field | DocType | Volume |
Complete bipartite graph,Discrete mathematics,Combinatorics,Indifference graph,Chordal graph,Bipartite graph,Algorithm,Hopcroft–Karp algorithm,Metric dimension,Mathematics,Strong perfect graph theorem,Maximal independent set | Journal | 32 |
Issue | ISSN | Citations |
2 | 1335-9150 | 0 |
PageRank | References | Authors |
0.34 | 8 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mihai Talmaciu | 1 | 4 | 2.83 |
| Elena Nechita | 2 | 4 | 1.48 |
| Barna Iantovics | 3 | 2 | 1.07 |