Graph Algorithms and Applications
Graph Algorithms and Applications
English[eng]
9783040000000
planar graphs||k-planarity||NP-hardness||polynomial time reduction||cliques||paths||computational social choice||election control||multi-winner election||social influence||influence maximization||congestion games||pure Nash equilibrium||potential games||price of anarchy||price of stability||phylogenetic tree||evolutionary tree||ancestral mixture model||mixture tree||mixture distance||tree comparison||clique independent set||clique transversal number||signed clique transversal function||minus clique transversal function||k-fold clique transversal set||distance-hereditary graphs||stretch number||recognition problem||forbidden subgraphs||hole detection||analysis and design or graph algorithms||distributed graph and network algorithms||graph theory with algorithmic applications||computational complexity of graph problems||experimental evaluation of graph algorithms
English[eng]
9783040000000
planar graphs||k-planarity||NP-hardness||polynomial time reduction||cliques||paths||computational social choice||election control||multi-winner election||social influence||influence maximization||congestion games||pure Nash equilibrium||potential games||price of anarchy||price of stability||phylogenetic tree||evolutionary tree||ancestral mixture model||mixture tree||mixture distance||tree comparison||clique independent set||clique transversal number||signed clique transversal function||minus clique transversal function||k-fold clique transversal set||distance-hereditary graphs||stretch number||recognition problem||forbidden subgraphs||hole detection||analysis and design or graph algorithms||distributed graph and network algorithms||graph theory with algorithmic applications||computational complexity of graph problems||experimental evaluation of graph algorithms