全部文献期刊学位论文会议报纸专利标准年鉴图书|学者科研项目
中外文文献  中文文献  外文文献
作者:Federico Mancini , Andrea Ascoli-Marchetti ...
来源:[J].Journal of Orthopaedics and Traumatology, 2014, Vol.15 (4), pp.291-294Springer
摘要:Abstract(#br)Osteolytic vertebral erosion is usually related to tumours, spondylitis or spondylodiscitis. Few reports in the literature describe lytic lesions of anterior lumbar vertebral bodies resulting from abdominal aortic aneurysm or false aneurysm. We report a case of abdom...
作者:Federico Mancini
来源:[J].Discrete Applied Mathematics(IF 0.718), 2008, Vol.158 (7), pp.747-754Elsevier
摘要:Abstract(#br)In this paper we investigate how graph problems that are NP-hard in general, but polynomial time solvable on split graphs, behave on input graphs that are close to being split. For this purpose we define split + k e and split + k v graphs to be the graphs that can be...
作者:Daniel Lokshtanov , Federico Mancini , Charis Papadopoulos
来源:[J].Discrete Applied Mathematics(IF 0.718), 2009, Vol.158 (7), pp.755-764Elsevier
摘要:Abstract(#br)A cograph completion of an arbitrary graph G is a cograph supergraph of G on the same vertex set. Such a completion is called minimal if the set of edges added to G is inclusion minimal. In this paper we present two results on minimal cograph completions. The fi...
作者:Pinar Heggernes , Federico Mancini
来源:[J].Discrete Applied Mathematics(IF 0.718), 2008, Vol.157 (12), pp.2659-2669Elsevier
摘要:Abstract(#br)We study the problem of adding an inclusion minimal set of edges to a given arbitrary graph so that the resulting graph is a split graph, called a minimal split completion of the input graph. Minimal completions of arbitrary graphs into chordal and interval graphs ha...
作者:Federico Mancini , Charis Papadopoulos
来源:[J].Theoretical Computer Science(IF 0.489), 2009, Vol.411 (7), pp.1202-1211Elsevier
摘要:Abstract(#br)The Correlation Clustering problem, also known as the Cluster Editing problem, seeks to edit a given graph by adding and deleting edges to obtain a collection of vertex-disjoint cliques, such that the editing cost is minimized. The Edge Clique Partitioning probl...
作者:Pinar Heggernes , Federico Mancini
来源:[J].Discrete Applied Mathematics(IF 0.718), 2008, Vol.157 (9), pp.2057-2069Elsevier
摘要:Abstract(#br)We present an algorithm that supports operations for modifying a split graph by adding edges or vertices and deleting edges, such that after each modification the graph is repaired to become a split graph in a minimal way. In particular, if the graph is not split aft...
作者:Federico Mancini , Fernando De Maio
来源:[J].Injury(IF 1.931), 2006, Vol.37 (9), pp.843-848Elsevier
摘要:Summary(#br)Fracture-separation of the distal humeral epiphysis is a rare injury described in young children. The diagnosis is often difficult because most of the ossification centre are not visible.(#br)We report a long-term follow-up study of five cases, evaluated after an aver...
作者:Pinar Heggernes , Federico Mancini , Charis Papadopoulos
来源:[J].Discrete Applied Mathematics(IF 0.718), 2007, Vol.156 (5), pp.705-718Elsevier
摘要:Abstract(#br)A transitive orientation of an undirected graph is an assignment of directions to its edges so that these directed edges represent a transitive relation between the vertices of the graph. Not every graph has a transitive orientation, but every graph can be turne...
作者:... Christian Hundt , Federico Mancini , Peter Wagner
来源:[J].Discrete Mathematics(IF 0.578), 2009, Vol.310 (4), pp.897-910Elsevier
摘要:Abstract(#br)Leaf powers are a graph class which has been introduced to model the problem of reconstructing phylogenetic trees. A graph G = ( V , E ) is called k -leaf power if it admits a k -leaf root, i.e., a tree T with leaves V such that u v is an edge in G if and only i...

我们正在为您处理中,这可能需要一些时间,请稍等。

资源合作:cnki.scholar@cnki.net, +86-10-82896619   意见反馈:scholar@cnki.net

×