{"id":"https://openalex.org/W2034050605","doi":"https://doi.org/10.1145/1277548.1277586","title":"Efficient matrix rank computation with application to the study of strongly regular graphs","display_name":"Efficient matrix rank computation with application to the study of strongly regular graphs","publication_year":2007,"publication_date":"2007-07-29","ids":{"openalex":"https://openalex.org/W2034050605","doi":"https://doi.org/10.1145/1277548.1277586","mag":"2034050605"},"language":"en","primary_location":{"id":"doi:10.1145/1277548.1277586","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1277548.1277586","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2007 international symposium on Symbolic and algebraic computation","raw_type":"proceedings-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/A5047230979","display_name":"John P. May","orcid":"https://orcid.org/0000-0001-8631-311X"},"institutions":[{"id":"https://openalex.org/I86501945","display_name":"University of Delaware","ror":"https://ror.org/01sbq1a82","country_code":"US","type":"education","lineage":["https://openalex.org/I86501945"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"John P. May","raw_affiliation_strings":["University of Delaware, Newark, DE"],"affiliations":[{"raw_affiliation_string":"University of Delaware, Newark, DE","institution_ids":["https://openalex.org/I86501945"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5061487757","display_name":"David Saunders","orcid":"https://orcid.org/0000-0002-0870-6644"},"institutions":[{"id":"https://openalex.org/I86501945","display_name":"University of Delaware","ror":"https://ror.org/01sbq1a82","country_code":"US","type":"education","lineage":["https://openalex.org/I86501945"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David Saunders","raw_affiliation_strings":["University of Delaware, Newark, DE"],"affiliations":[{"raw_affiliation_string":"University of Delaware, Newark, DE","institution_ids":["https://openalex.org/I86501945"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100519505","display_name":"Zhendong Wan","orcid":"https://orcid.org/0009-0006-2546-1294"},"institutions":[{"id":"https://openalex.org/I72816309","display_name":"Drexel University","ror":"https://ror.org/04bdffz58","country_code":"US","type":"education","lineage":["https://openalex.org/I72816309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zhendong Wan","raw_affiliation_strings":["Drexel University, Philadelphia, PA"],"affiliations":[{"raw_affiliation_string":"Drexel University, Philadelphia, PA","institution_ids":["https://openalex.org/I72816309"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5047230979"],"corresponding_institution_ids":["https://openalex.org/I86501945"],"apc_list":null,"apc_paid":null,"fwci":4.7898,"has_fulltext":false,"cited_by_count":25,"citation_normalized_percentile":{"value":0.94560519,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"277","last_page":"284"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10849","display_name":"Finite Group Theory Research","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10849","display_name":"Finite Group Theory Research","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/rank","display_name":"Rank (graph theory)","score":0.6139957904815674},{"id":"https://openalex.org/keywords/adjacency-matrix","display_name":"Adjacency matrix","score":0.6002029776573181},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.5481467843055725},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.46870750188827515},{"id":"https://openalex.org/keywords/projection","display_name":"Projection (relational algebra)","score":0.4661518335342407},{"id":"https://openalex.org/keywords/adjacency-list","display_name":"Adjacency list","score":0.46223053336143494},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.45426031947135925},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.43200066685676575},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4257570207118988},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.41439077258110046},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3807504177093506},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3767559230327606},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.33227741718292236},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3201506733894348},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.12009173631668091}],"concepts":[{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.6139957904815674},{"id":"https://openalex.org/C180356752","wikidata":"https://www.wikidata.org/wiki/Q727035","display_name":"Adjacency matrix","level":3,"score":0.6002029776573181},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.5481467843055725},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46870750188827515},{"id":"https://openalex.org/C57493831","wikidata":"https://www.wikidata.org/wiki/Q3134666","display_name":"Projection (relational algebra)","level":2,"score":0.4661518335342407},{"id":"https://openalex.org/C110484373","wikidata":"https://www.wikidata.org/wiki/Q264398","display_name":"Adjacency list","level":2,"score":0.46223053336143494},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.45426031947135925},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.43200066685676575},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4257570207118988},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.41439077258110046},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3807504177093506},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3767559230327606},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.33227741718292236},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3201506733894348},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.12009173631668091},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1277548.1277586","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1277548.1277586","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2007 international symposium on Symbolic and algebraic computation","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.136.8141","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.136.8141","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cis.udel.edu/~jpmay/docs/MaSaWa2007-Space_Efficient_pRank.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1502078890","https://openalex.org/W1502124338","https://openalex.org/W1585665186","https://openalex.org/W1965411348","https://openalex.org/W1998084064","https://openalex.org/W2003070515","https://openalex.org/W2027104314","https://openalex.org/W2029504359","https://openalex.org/W2045295714","https://openalex.org/W2055455800","https://openalex.org/W2055808951","https://openalex.org/W2060507785","https://openalex.org/W2071483197","https://openalex.org/W2097802496","https://openalex.org/W2104034609","https://openalex.org/W2141385399","https://openalex.org/W2149623001","https://openalex.org/W2327732228"],"related_works":["https://openalex.org/W2118050488","https://openalex.org/W4213150077","https://openalex.org/W2058655866","https://openalex.org/W2369410163","https://openalex.org/W2059018062","https://openalex.org/W2604585036","https://openalex.org/W2078477160","https://openalex.org/W1989103179","https://openalex.org/W1991172810","https://openalex.org/W125803343"],"abstract_inverted_index":{"We":[0,109,174],"present":[1,99,186],"algorithms":[2,165],"for":[3,75,190],"computing":[4],"the":[5,23,29,46,62,89,103,124,140,171,180,191],"p-rank":[6,60,90],"of":[7,48,61,65,136,152,179,188,196],"integer":[8],"matrices.":[9,129],"They":[10],"are":[11,168],"designed":[12],"to":[13,102,123,133,150],"be":[14],"particularly":[15],"effective":[16,118],"when":[17],"p":[18],"is":[19,25,32,71,116,144,147,156],"a":[20,72,111,134,159],"small":[21,104,106,160],"prime,":[22,105],"rank":[24,107],"relatively":[26],"low,":[27],"and":[28,34,36,51,80,86,98,155,166,184,193],"matrix":[30,64,135],"itself":[31],"large":[33],"dense":[35,161],"may":[37],"exceed":[38],"virtual":[39],"memory":[40,95],"space.":[41],"Our":[42,164],"motivation":[43],"comes":[44],"from":[45],"study":[47],"difference":[49,53,77],"sets":[50,54],"partial":[52],"in":[55,119,170],"algebraic":[56],"design":[57,182],"theory.":[58],"The":[59,142],"adjacency":[63,128],"an":[66],"associated":[67],"strongly":[68,125,197],"regular":[69,126,198],"graph":[70,127],"key":[73],"tool":[74],"distinguishing":[76],"set":[78],"constructions":[79],"thus":[81],"answering":[82],"various":[83],"existence":[84],"questions":[85],"conjectures.":[87],"For":[88],"computation,":[91],"we":[92,185],"review":[93],"several":[94,153],"efficient":[96],"methods,":[97],"refinements":[100],"suitable":[101],"case.":[108],"give":[110],"new":[112],"heuristic":[113],"approach":[114],"that":[115],"notably":[117],"practice":[120],"as":[121],"applied":[122],"It":[130],"involves":[131],"projection":[132,143],"order":[137],"slightly":[138],"above":[139],"rank.":[141],"extremely":[145],"sparse,":[146],"chosen":[148],"according":[149],"one":[151],"heuristics,":[154],"combined":[157],"with":[158],"certifying":[162],"component.":[163],"heuristics":[167],"implemented":[169],"LinBox":[172],"library.":[173],"also":[175],"briefly":[176],"discuss":[177],"some":[178],"software":[181],"issues":[183],"results":[187],"experiments":[189],"Paley":[192],"Dickson":[194],"sequences":[195],"graphs.":[199]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":5}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}