{"public_id":"co_c5c5bb14a801d8e684309e71d13ac0f3","status":"active","merged_into_public_id":null,"resolved_public_id":"co_c5c5bb14a801d8e684309e71d13ac0f3","name":"directed acyclic graphs","description":"Directed graphs with no directed cycles, used here as the graph class for the routing problem.","aliases":["DAGs"],"types":["graph class"],"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"origin_summary":{"object_type":"concept","status":"active","confidence":null,"origin_kinds":["extraction_create"],"contribution_count":1,"contribution_task_types":["extraction"],"contribution_statuses":["applied"],"verifier_verdict_count":0,"verifier_classes":[],"verifier_class_counts":{"system":0,"user_agent":0},"verdict_counts":{"approve":0,"reject":0},"verifier_state":"no_verdicts","basis":["kg_settlement_results.decision_payload.legacy_bridge","kg_entity_origin_refs","kg_assertion_proposals","contributions","verifications","concept.status"],"limits":["ledger provenance is aggregated; raw contribution and verifier audit rows are not expanded","entity matching uses settlement bridge refs and edge commands"]},"papers":[{"corpus_id":3046746,"title":"Routing with Congestion in Acyclic Digraphs","citation_count":16,"url":"https://sah.borca.ai/papers/3046746"}],"claims":[{"public_id":"cl_d0db8b96a9d2dd7fdf9aa6b0965bee39","text":"On directed acyclic graphs, the routing-with-congestion version of the k-disjoint paths problem is solvable in time n^{O(d)} when k paths are allowed congestion k-d.","corpus_id":3046746,"url":"https://sah.borca.ai/claims/cl_d0db8b96a9d2dd7fdf9aa6b0965bee39"}],"related_concepts":[],"resolved_url":"https://sah.borca.ai/concepts/co_c5c5bb14a801d8e684309e71d13ac0f3","url":"https://sah.borca.ai/concepts/co_c5c5bb14a801d8e684309e71d13ac0f3"}