Add to ORKG[[sponsorship]]資訊科學研究所,資訊科技創新研究中心[[note]]已出版;[SCI];有審查制度;具代表性[[note]]http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=Drexel&SrcApp=hagerty_opac&KeyRecord=0895-4801&DestApp=JCR&RQ=IF_CAT_BOXPLO
AbstractExtending notions from undirected graphs, we introduce directed graphs with the property tha...
AbstractIn this paper, we show that the clique-transversal number τC(G) and the clique-independence ...
AbstractDistance-hereditary graphs (graphs in which the distances are preserved by induced subgraphs...
[[sponsorship]]資訊科學研究所,資訊科技創新研究中心[[note]]已出版;[SCI];有審查制度;具代表性[[note]]http://gateway.isiknowledge.com...
AbstractIn this work we introduce, characterize, and provide algorithmic results for (k,+)-distance-...
AbstractGiven a simple and finite connected graph G, the distance dG(u,v) is the length of the short...
Distance-hereditary graphs are graphs in which every two vertices have the same distance in every co...
In this work we introduce, characterize, and provide algorithmic results for (k, +)–distance-heredit...
Open ArchiveInternational audienceIn this note, we provide a new and simple algorithm to compute max...
Work partially supported by MPI National projects on Theory of Algorithms and Formal Aspects of Data...
AbstractIn this note, we provide a new and simple algorithm to compute maximum stable sets for dista...
AbstractIn this work we introduce, characterize, and provide algorithmic results for (k,+)-distance-...
Powers of distance-hereditary graphs need not be distance-hereditary, but they come close : the hous...
In this paper, we consider the graph class denoted as Gen(∗;P3,C3,C5). It contains all graphs that c...
AbstractDistance-hereditary graphs (sensu Howorka) are connected graphs in which all induced paths a...
AbstractExtending notions from undirected graphs, we introduce directed graphs with the property tha...
AbstractIn this paper, we show that the clique-transversal number τC(G) and the clique-independence ...
AbstractDistance-hereditary graphs (graphs in which the distances are preserved by induced subgraphs...
[[sponsorship]]資訊科學研究所,資訊科技創新研究中心[[note]]已出版;[SCI];有審查制度;具代表性[[note]]http://gateway.isiknowledge.com...
AbstractIn this work we introduce, characterize, and provide algorithmic results for (k,+)-distance-...
AbstractGiven a simple and finite connected graph G, the distance dG(u,v) is the length of the short...
Distance-hereditary graphs are graphs in which every two vertices have the same distance in every co...
In this work we introduce, characterize, and provide algorithmic results for (k, +)–distance-heredit...
Open ArchiveInternational audienceIn this note, we provide a new and simple algorithm to compute max...
Work partially supported by MPI National projects on Theory of Algorithms and Formal Aspects of Data...
AbstractIn this note, we provide a new and simple algorithm to compute maximum stable sets for dista...
AbstractIn this work we introduce, characterize, and provide algorithmic results for (k,+)-distance-...
Powers of distance-hereditary graphs need not be distance-hereditary, but they come close : the hous...
In this paper, we consider the graph class denoted as Gen(∗;P3,C3,C5). It contains all graphs that c...
AbstractDistance-hereditary graphs (sensu Howorka) are connected graphs in which all induced paths a...
AbstractExtending notions from undirected graphs, we introduce directed graphs with the property tha...
AbstractIn this paper, we show that the clique-transversal number τC(G) and the clique-independence ...
AbstractDistance-hereditary graphs (graphs in which the distances are preserved by induced subgraphs...