Vertex cover in conflict graphs
Copyright policy )Vertex cover in conflict graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
- Harbin Institute of Technology China (People's Republic of)
- Georgia State University United States
complete multipartite graph, Approximation algorithms, vertex cover, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Graph theory (including graph drawing) in computer science, Graph algorithms (graph-theoretic aspects), graph coloring, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), approximation algorithm
complete multipartite graph, Approximation algorithms, vertex cover, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Graph theory (including graph drawing) in computer science, Graph algorithms (graph-theoretic aspects), graph coloring, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), approximation algorithm
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).3 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!