{"id":"https://openalex.org/W7135226315","doi":"https://doi.org/10.48550/arxiv.2603.11478","title":"Graph Generation Methods under Partial Information","display_name":"Graph Generation Methods under Partial Information","publication_year":2026,"publication_date":"2026-03-12","ids":{"openalex":"https://openalex.org/W7135226315","doi":"https://doi.org/10.48550/arxiv.2603.11478"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.11478","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.11478","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2603.11478","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5128962534","display_name":"Tong Sun","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sun, Tong","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5128933558","display_name":"Jianshu Hao","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hao, Jianshu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5129088952","display_name":"Michael C. Fu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Fu, Michael C.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5129050437","display_name":"Guangxin Jiang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jiang, Guangxin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11435","display_name":"Polynomial and algebraic computation","score":0.1745000034570694,"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/T11435","display_name":"Polynomial and algebraic computation","score":0.1745000034570694,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.15060000121593475,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.10819999873638153,"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/bipartite-graph","display_name":"Bipartite graph","score":0.72079998254776},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.5620999932289124},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4862000048160553},{"id":"https://openalex.org/keywords/connection","display_name":"Connection (principal bundle)","score":0.4271000027656555},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.37279999256134033},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.3472000062465668},{"id":"https://openalex.org/keywords/comparability-graph","display_name":"Comparability graph","score":0.3465000092983246}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.72079998254776},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5620999932289124},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4862000048160553},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4778999984264374},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4749999940395355},{"id":"https://openalex.org/C13355873","wikidata":"https://www.wikidata.org/wiki/Q2920850","display_name":"Connection (principal bundle)","level":2,"score":0.4271000027656555},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4207000136375427},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.41200000047683716},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.37279999256134033},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.3472000062465668},{"id":"https://openalex.org/C198414033","wikidata":"https://www.wikidata.org/wiki/Q5155607","display_name":"Comparability graph","level":5,"score":0.3465000092983246},{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.33000001311302185},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3280999958515167},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.3073999881744385},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3043999969959259},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.29910001158714294},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.29499998688697815},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.2800999879837036},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.2644999921321869},{"id":"https://openalex.org/C148067565","wikidata":"https://www.wikidata.org/wiki/Q3323718","display_name":"Moral graph","level":5,"score":0.2549000084400177}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.11478","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.11478","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2603.11478","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.11478","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,17,66],"study":[1],"the":[2,37,74,95,103,106],"problem":[3,64],"of":[4,40,105],"generating":[5],"graphs":[6],"with":[7],"prescribed":[8],"degree":[9],"sequences":[10],"for":[11,23,62],"bipartite,":[12],"directed,":[13],"and":[14,27,31,58,76,89],"undirected":[15,77],"networks.":[16],"first":[18],"propose":[19],"a":[20,29],"sequential":[21],"method":[22],"bipartite":[24,55,70],"graph":[25,56,71],"generation":[26],"establish":[28],"necessary":[30],"sufficient":[32],"interval":[33],"condition":[34],"that":[35],"characterizes":[36],"admissible":[38],"number":[39],"connections":[41],"at":[42],"each":[43],"step,":[44],"thereby":[45],"guaranteeing":[46],"global":[47],"feasibility.":[48],"Based":[49],"on":[50],"this":[51],"result,":[52],"we":[53],"develop":[54],"enumeration":[57],"sampling":[59],"algorithms":[60,72],"suitable":[61],"different":[63],"sizes.":[65],"then":[67],"extend":[68],"these":[69],"to":[73,112],"directed":[75],"cases":[78],"by":[79],"incorporating":[80],"additional":[81],"connection":[82,91],"constraints,":[83],"as":[84,86],"well":[85],"feasibility":[87],"verification":[88],"symmetric":[90],"steps,":[92],"while":[93],"preserving":[94],"same":[96],"algorithmic":[97],"principles.":[98],"Finally,":[99],"numerical":[100],"experiments":[101],"demonstrate":[102],"performance":[104],"proposed":[107],"algorithms,":[108],"particularly":[109],"their":[110],"scalability":[111],"large":[113],"instances":[114],"where":[115],"existing":[116],"methods":[117],"become":[118],"computationally":[119],"prohibitive.":[120]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-03-14T00:00:00"}