On the computational complexity of path cover problems
Copyright policy )On the computational complexity of path cover problems
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
- The University of Texas System United States
- The University of Texas at Dallas United States
Computer Networks and Communications, Analysis of algorithms and problem complexity, Applied Mathematics, Directed graphs (digraphs), tournaments, reachability relation, Theoretical Computer Science, acyclic structured digraphs, Computational Theory and Mathematics, Graph theory (including graph drawing) in computer science, rooted trees, path cover problems, Paths and cycles, acyclic digraphs
Computer Networks and Communications, Analysis of algorithms and problem complexity, Applied Mathematics, Directed graphs (digraphs), tournaments, reachability relation, Theoretical Computer Science, acyclic structured digraphs, Computational Theory and Mathematics, Graph theory (including graph drawing) in computer science, rooted trees, path cover problems, Paths and cycles, acyclic digraphs
citations 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!