王维凡

professor  

Gender : Male

Alma Mater : 南京大学

Education Level : Graduate student graduate

Degree : Doctorate

Status : 退休

School/Department : 数学科学学院

Date of Employment : 2002-05-01


Paper achievements

The Minimum Number of Dependent Arcs in….

Hits :

First Author : Fengwei Xu

Affiliation of Author(s): 数理与信息工程学院

Date of Publication : 2011-01-01

Document Type : 期刊

Journal : Tamsui Oxford Journal of Information & Mathematical Sciences (TOJIMS)

Volume: Vol.27

Issue : No.4

Page Number : 397-410

ISSN : 2222-4424

Translation or Not : no

Key Words : GRAPH;theory;*PATHS;&;cycles;(Graph;theory);*LINEAR;dependence;(Mathematics);*COMBINATORIAL;analysis;*MATHEMATICAL;analysis;*IMAGE;analysis

Abstract : Let D be an acyclic orientation of a simple graph G. An arc is called dependent if its reversal creates a directed cycle. Let d(D) denote the number of dependent arcs in D. Define dmin(G) to be the minimum number of d(D) over all acyclic orientations D of

Pre One : The -labelling of trees

Next One : Analysis of k-partite ranking algorithm in area under the receiver operating characteristic curve criterion

Recommend this Article