Graph modification problem for some classes of graphs
Copyright policy )Graph modification problem for some classes of graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
- University of Dayton United States
graph completion, Computer Sciences, chordal bipartite, graph deletion, Graph algorithms (graph-theoretic aspects), strongly chordal, Graphics and Human Computer Interfaces, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), Structural characterization of families of graphs, chordal, Other Computer Sciences
graph completion, Computer Sciences, chordal bipartite, graph deletion, Graph algorithms (graph-theoretic aspects), strongly chordal, Graphics and Human Computer Interfaces, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), Structural characterization of families of graphs, chordal, Other Computer Sciences
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).5 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!