Approximate constrained bipartite edge coloring
Copyright policy )Approximate constrained bipartite edge coloring
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Applied Mathematics, Randomized algorithms, perfect matchings, Approximation algorithms, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], Coloring of graphs and hypergraphs, randomized rounding, Graph theory (including graph drawing) in computer science, bipartite graph, Discrete Mathematics and Combinatorics, edge coloring, multicommodity flows
Applied Mathematics, Randomized algorithms, perfect matchings, Approximation algorithms, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], Coloring of graphs and hypergraphs, randomized rounding, Graph theory (including graph drawing) in computer science, bipartite graph, Discrete Mathematics and Combinatorics, edge coloring, multicommodity flows
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).1 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!