{"id":"https://openalex.org/W2065756109","doi":"https://doi.org/10.1137/s0895480197330242","title":"Rankings of Directed Graphs","display_name":"Rankings of Directed Graphs","publication_year":1999,"publication_date":"1999-01-01","ids":{"openalex":"https://openalex.org/W2065756109","doi":"https://doi.org/10.1137/s0895480197330242","mag":"2065756109"},"language":"en","primary_location":{"id":"doi:10.1137/s0895480197330242","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0895480197330242","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5066646775","display_name":"Jan Kratochv\u0131\u0301l","orcid":"https://orcid.org/0000-0002-2620-6133"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Jan Kratochv\u00edl","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5107094827","display_name":"Zsolt Tuza","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zsolt Tuza","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5066646775"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.19353119,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":97},"biblio":{"volume":"12","issue":"3","first_page":"374","last_page":"384"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9951000213623047,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9919000267982483,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8689776062965393},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7979693412780762},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.644761323928833},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6217013001441956},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.605724573135376},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5982679724693298},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.5305006504058838},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5249164700508118},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4774221181869507},{"id":"https://openalex.org/keywords/ranking","display_name":"Ranking (information retrieval)","score":0.44931453466415405},{"id":"https://openalex.org/keywords/feedback-arc-set","display_name":"Feedback arc set","score":0.43599557876586914},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3812641203403473},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.1492377519607544},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.10620158910751343},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.10164105892181396}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8689776062965393},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7979693412780762},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.644761323928833},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6217013001441956},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.605724573135376},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5982679724693298},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.5305006504058838},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5249164700508118},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4774221181869507},{"id":"https://openalex.org/C189430467","wikidata":"https://www.wikidata.org/wiki/Q7293293","display_name":"Ranking (information retrieval)","level":2,"score":0.44931453466415405},{"id":"https://openalex.org/C157951044","wikidata":"https://www.wikidata.org/wiki/Q1400910","display_name":"Feedback arc set","level":5,"score":0.43599557876586914},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3812641203403473},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.1492377519607544},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.10620158910751343},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.10164105892181396},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0895480197330242","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0895480197330242","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W2024997287","https://openalex.org/W2032004078","https://openalex.org/W2039985220","https://openalex.org/W2154567859","https://openalex.org/W2156678756","https://openalex.org/W4230866682","https://openalex.org/W4231773516","https://openalex.org/W4231906363"],"related_works":["https://openalex.org/W4287028074","https://openalex.org/W2354764436","https://openalex.org/W3191289342","https://openalex.org/W4288723498","https://openalex.org/W4292730466","https://openalex.org/W2350111251","https://openalex.org/W4297817344","https://openalex.org/W2555805899","https://openalex.org/W1512669878","https://openalex.org/W2603633312"],"abstract_inverted_index":{"A":[0],"ranking":[1,66,102],"of":[2,8,26,34,42,68,71,78,104,109,125],"a":[3,6,17,32,72,105,117],"graph":[4,113],"is":[5,31,49,74,114,119,130],"coloring":[7],"the":[9,27,39,46,65,95,101,123],"vertex":[10,33],"set":[11],"with":[12],"positive":[13],"integers":[14],"in":[15,55,91],"such":[16],"way":[18],"that":[19,64,77,86],"on":[20,52],"every":[21],"path":[22,82],"connecting":[23],"two":[24],"vertices":[25],"same":[28],"color":[29],"there":[30],"larger":[35],"color.":[36],"We":[37,62],"consider":[38],"directed":[40,81,106],"variant":[41],"this":[43],"problem,":[44],"where":[45],"above":[47],"condition":[48],"imposed":[50],"only":[51],"those":[53],"paths":[54],"which":[56],"all":[57],"edges":[58],"are":[59],"oriented":[60],"consecutively.":[61],"show":[63],"number":[67,103],"an":[69,110],"orientation":[70],"tree":[73],"bounded":[75,115],"by":[76,116],"its":[79],"longest":[80],"plus":[83],"one,":[84],"and":[85],"it":[87],"can":[88],"be":[89],"computed":[90],"polynomial":[92],"time.":[93],"Unlike":[94],"undirected":[96],"case,":[97],"however,":[98],"deciding":[99],"whether":[100],"(and":[107],"even":[108],"acyclic":[111,128],"directed)":[112],"constant":[118],"NP-complete.":[120],"In":[121],"fact,":[122],"3-ranking":[124],"planar":[126],"bipartite":[127],"digraphs":[129],"already":[131],"hard.":[132]},"counts_by_year":[{"year":2013,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}