Computing and Combinatorics
From MaRDI portal
Publication:5716994
DOI10.1007/11533719zbMath1128.05308OpenAlexW4376561447MaRDI QIDQ5716994
Michael A. Langston, Yun Zhang, W. Henry Suters, Nagiza F. Samatova, Christopher T. Symons, Faisal N. Abu-Khzam
Publication date: 11 January 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11533719
Analysis of algorithms (68W40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Maximum common induced subgraph parameterized by vertex cover, Listing Maximal Subgraphs Satisfying Strongly Accessible Properties, Polyhedral study of the maximum common induced subgraph problem, A fast discovery algorithm for large common connected induced subgraphs