{"id":"https://openalex.org/W2089522921","doi":"https://doi.org/10.1137/s0097539796308151","title":"Virtual Path Layouts in ATM Networks","display_name":"Virtual Path Layouts in ATM Networks","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W2089522921","doi":"https://doi.org/10.1137/s0097539796308151","mag":"2089522921"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539796308151","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539796308151","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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 Computing","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/A5085438222","display_name":"Ladislav Stacho","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Ladislav Stacho","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5063290861","display_name":"Imrich Vrt\u2019o","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Imrich Vrto","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5085438222"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.7156,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.87469541,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"29","issue":"5","first_page":"1621","last_page":"1629"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":1.0,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9991000294685364,"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/T10847","display_name":"Advanced Optical Network Technologies","score":0.9983999729156494,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/hypercube","display_name":"Hypercube","score":0.7133104801177979},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5712661147117615},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5371428728103638},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.530543863773346},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5257761478424072},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.4957796037197113},{"id":"https://openalex.org/keywords/hop","display_name":"Hop (telecommunications)","score":0.4830925464630127},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.47690749168395996},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.4699302613735199},{"id":"https://openalex.org/keywords/asynchronous-transfer-mode","display_name":"Asynchronous Transfer Mode","score":0.4586193263530731},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.45372274518013},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.4495375156402588},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44098758697509766},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.43644705414772034},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.42631950974464417},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.35599613189697266},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.26778069138526917},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.22394919395446777},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.21498292684555054}],"concepts":[{"id":"https://openalex.org/C50820777","wikidata":"https://www.wikidata.org/wiki/Q213723","display_name":"Hypercube","level":2,"score":0.7133104801177979},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5712661147117615},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5371428728103638},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.530543863773346},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5257761478424072},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.4957796037197113},{"id":"https://openalex.org/C25906391","wikidata":"https://www.wikidata.org/wiki/Q1432381","display_name":"Hop (telecommunications)","level":2,"score":0.4830925464630127},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.47690749168395996},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.4699302613735199},{"id":"https://openalex.org/C194571728","wikidata":"https://www.wikidata.org/wiki/Q206047","display_name":"Asynchronous Transfer Mode","level":2,"score":0.4586193263530731},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.45372274518013},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.4495375156402588},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44098758697509766},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.43644705414772034},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.42631950974464417},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.35599613189697266},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.26778069138526917},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.22394919395446777},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.21498292684555054},{"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/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1137/s0097539796308151","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539796308151","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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 Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.37.8207","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.37.8207","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ifi.savba.sk/pub/laco/papers/conges.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.46.2127","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.46.2127","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ifi.savba.sk/pub/imrich/siam1.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.48.1951","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.48.1951","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ifi.savba.sk/pub/imrich/sirocco96.ps.gz","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":3,"referenced_works":["https://openalex.org/W1970580433","https://openalex.org/W2086779593","https://openalex.org/W4241840173"],"related_works":["https://openalex.org/W4286907761","https://openalex.org/W2916710807","https://openalex.org/W2413588304","https://openalex.org/W3205447645","https://openalex.org/W2009411567","https://openalex.org/W2371629703","https://openalex.org/W2097769911","https://openalex.org/W2774705104","https://openalex.org/W2122343781","https://openalex.org/W2123417578"],"abstract_inverted_index":{"We":[0],"study":[1],"virtual":[2,41,59,80],"path":[3,31,81],"layouts":[4,32],"in":[5,25],"a":[6,48,63,79,103],"very":[7],"popular":[8],"type":[9],"of":[10,21,40,50,58,92,152],"fast":[11],"interconnection":[12],"networks,":[13],"namely":[14],"asynchronous":[15],"transfer":[16],"mode":[17],"(ATM)":[18],"networks.":[19,177],"One":[20],"the":[22,35,38,51,56,90,93,141,150,157],"main":[23],"problems":[24],"such":[26],"networks":[27,139,155],"is":[28,89,98],"to":[29],"construct":[30,69],"that":[33,131],"minimize":[34],"hop-number":[36,84],"(i.e.,":[37,55],"number":[39,57],"paths":[42,60,184],"between":[43],"any":[44,71,77,146,166],"two":[45],"nodes)":[46],"as":[47],"function":[49],"edge":[52],"congestion":[53,147],"c":[54,78],"going":[61],"through":[62],"link).":[64],"In":[65,149],"this":[66,170],"paper":[67],"we":[68,129,179],"for":[70,136,145,165,174,183,191],"n":[72],"vertex":[73],"network":[74,94],"H":[75,95],"and":[76,96,112,120,185,187],"layout":[82],"with":[83,140],"$O(\\frac{diam(H)\\log\\Delta}{\\log":[85],"c})$,":[86],"where":[87],"diam(H)":[88],"diameter":[91,142,158],"$\\Delta$":[97],"its":[99],"maximum":[100],"degree.":[101],"Involving":[102],"general":[104],"lower":[105],"bound":[106],"from":[107],"[E.":[108],"Kranakis,":[109],"D.":[110],"Krizanc,":[111],"A.":[113],"Pelc,":[114],"Seventh":[115],"IEEE":[116,123],"Symposium":[117],"on":[118],"Parallel":[119],"Distributed":[121],"Processing,":[122],"Computer":[124],"Society,":[125],"1995,":[126],"pp.":[127],"662--668],":[128],"see":[130],"these":[132,161],"hop-numbers":[133,162,173,190],"are":[134,163],"optimal":[135,164,172,189],"bounded":[137],"degree":[138,154],"O(log":[143,159],"n)":[144],"c.":[148],"case":[151],"unbounded":[153],"(with":[156],"n))":[160],"$c\\geq\\Delta$.":[167],"For":[168],"instance,":[169],"gives":[171],"hypercube":[175],"related":[176],"Moreover,":[178],"improve":[180],"known":[181],"results":[182],"meshes":[186],"prove":[188],"hypercubes.":[192]},"counts_by_year":[],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}