Misgiving
发表于 2025-3-30 08:51:02
Gerätetechnik zur HöchstlastoptimierungWe define an ordering of vertices of a chordal bipartite graph. By using this ordering, we give a linear time algorithm for the maximum matching problem and an .(..) time algorithm for the minimum fill-in problem on chordal bipartite graphs improving previous results.
CAJ
发表于 2025-3-30 15:25:38
Gerätetechnik zur HöchstlastoptimierungTwo variations of the graph searching problem, edge searching and node searching, are studied on several classes of chordal graphs, which include split graphs, interval graphs and .-starlike graphs.
IST
发表于 2025-3-30 18:11:24
Der Leistungsbegriff in der Sozialen Arbeit,We present an efficient algorithm for computing the vertex ranking number of an asteroidal triple-free graph. Its running time is bounded by a polynomial in the number of vertices and the number of minimal separators of the input graph.
ingenue
发表于 2025-3-30 21:46:45
http://reply.papertrans.cn/16/1532/153129/153129_54.png
morale
发表于 2025-3-31 04:02:25
http://reply.papertrans.cn/16/1532/153129/153129_55.png
Stagger
发表于 2025-3-31 05:04:49
Vertex ranking of asteroidal triple-free graphs,We present an efficient algorithm for computing the vertex ranking number of an asteroidal triple-free graph. Its running time is bounded by a polynomial in the number of vertices and the number of minimal separators of the input graph.
incite
发表于 2025-3-31 11:54:42
https://doi.org/10.1007/BFb0009475Algorithmische Geometrie; Graph-Algorithmen; Kombinatorik; Komplexitätstheorie; Netzwerkbetrieb; Routing;
异端邪说2
发表于 2025-3-31 15:22:56
978-3-540-62048-8Springer-Verlag Berlin Heidelberg 1996
Nomogram
发表于 2025-3-31 21:14:20
Algorithms and Computation978-3-540-49633-5Series ISSN 0302-9743 Series E-ISSN 1611-3349
大包裹
发表于 2025-3-31 23:35:23
Applications of a numbering scheme for polygonal obstacles in the plane,e pairs with mutually nonintersecting paths that have useful geometric properties. We first consider matching . red and . blue disjoint isothetic rectangles and connecting the . matched rectangle pairs with nonintersecting monotone rectilinear paths; each such path consists of . segments and is not