Computing a feedback arc set using PageRank (Q6117047): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Aggregating inconsistent information / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3154375 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A fast and effective heuristic for the feedback arc set problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The NP-completeness column: An ongoing gulde / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Reducibility Among Combinatorial Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A New Framework for Hierarchical Drawings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3642544 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank | |||
Normal rank |
Latest revision as of 15:57, 2 August 2024
scientific article; zbMATH DE number 7727761
Language | Label | Description | Also known as |
---|---|---|---|
English | Computing a feedback arc set using PageRank |
scientific article; zbMATH DE number 7727761 |
Statements
Computing a feedback arc set using PageRank (English)
0 references
16 August 2023
0 references
feedback arc set
0 references
hierarchical graph drawing
0 references
PageRank
0 references
line graph
0 references