{"doi":"10.1016/j.jvlc.2017.09.004","title":"Convergent drawing for mutually connected directed graphs","abstract":null,"journal":"Journal of Visual Languages & Computing","year":2017,"id":600977,"datarank":0.3453877639491069,"base_score":2.302585092994046,"endowment":2.302585092994046,"self_citation_contribution":0.3453877639491069,"citation_network_contribution":0.0,"self_endowment_contribution":0.3453877639491069,"citer_contribution":0.0,"corpus_percentile":null,"corpus_rank":null,"citation_count":9,"citer_count":0,"citers_with_citation_signal":0,"citers_with_endowment":0,"datacite_reuse_total":0,"is_dataset":false,"is_dataset_confidence":null,"is_data_producer":false,"deposit_databanks":null,"is_oa":false,"file_count":0,"downloads":0,"has_version_chain":false,"published_date":null,"fair_score":null,"fair_percentile":null,"algorithm_id":"datarank_citation_only_1hop_v6","ranking_scope":"data_only","authors":[{"id":1540826,"name":"Rina Nakazawa","orcid":null,"position":1,"is_corresponding":false},{"id":1540827,"name":"Takayuki Itoh","orcid":null,"position":2,"is_corresponding":false},{"id":1471358,"name":"Takafumi Saito","orcid":"0000-0002-1169-0970","position":3,"is_corresponding":false},{"id":1540828,"name":"Daniel Archambault","orcid":null,"position":4,"is_corresponding":false},{"id":1540824,"name":"Naoko Toeda","orcid":null,"position":0,"is_corresponding":false}],"reference_count":0,"raw_metadata":{"has_enrichment":true,"resolved":true,"title":"Convergent drawing for mutually connected directed graphs","abstract":null,"is_dataset_classified":null,"base_score":2.302585092994046,"endowment":2.302585092994046,"datacite_reuse_total":0,"file_count":0,"downloads":0,"views":0,"has_version_chain":false,"is_dataset":false,"is_oa":false,"pmid":"23304386","pmcid":null,"openalex_id":"https://openalex.org/W2766563406","authors":[],"funders":[],"total_grants":0,"fwci":0.2155,"citation_percentile":0.60759238,"influential_citations":0,"citation_trend":[{"year":2017,"count":1},{"year":2019,"count":1},{"year":2021,"count":2},{"year":2023,"count":2},{"year":2025,"count":2},{"year":2026,"count":1}],"oa_status":"closed","license":"https://www.elsevier.com/tdm/userlicense/1.0/","oa_locations":[{"url":"https://api.elsevier.com/content/article/PII:S1045926X17301659?httpAccept=text/xml","host_type":"publisher"},{"url":"https://api.elsevier.com/content/article/PII:S1045926X17301659?httpAccept=text/plain","host_type":"publisher"},{"url":"https://doi.org/10.1016/j.jvlc.2017.09.004","host_type":"journal"},{"url":"https://cronfa.swan.ac.uk/Record/cronfa34903","host_type":"repository"}],"fields_of_study":["Data Visualization and Analytics","Complex Network Analysis Techniques","Topological and Geometric Data Analysis"],"mesh_terms":[],"keywords":["Graph drawing","Computer science","Graph Layout","Node (physics)","Enhanced Data Rates for GSM Evolution","Theoretical computer science","Visualization","Graph","Convergence (economics)","Topology (electrical circuits)","Data mining","Artificial intelligence","Combinatorics","Mathematics"],"sdg_mappings":[],"linked_datasets":[],"clinical_trials":[],"software_tools":[],"database_accessions":[],"source":"live","citation_network_status":"fetched"},"created_at":"2026-07-29T14:44:06.080771Z","pmid":null,"pmcid":null,"fwci":null,"citation_percentile":null,"influential_citations":0,"oa_status":null,"license":null,"views":0,"total_file_size_bytes":0,"version_count":0,"fair_f":null,"fair_a":null,"fair_i":null,"fair_r":null,"fair_zscore":null,"fair_rationale":null,"fair_model":null,"fair_agent_version":null,"fair_fulltext_source":null,"fair_has_llm":null,"fair_computed_at":null,"clinical_trials":[],"software_tools":[],"db_accessions":[],"linked_datasets":[],"topics":[]}