Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("DIRECTED GRAPH")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 5377

  • Page / 216

Export

Selection :

  • and

COMPUTING EXTREMAL AND APPROXIMATE DISTANCES IN GRAPHS HAVING UNIT COST EDGESBOOTH KS; LIPTON RJ.1981; ACTA INF.; ISSN 0001-5903; DEU; DA. 1981; VOL. 15; NO 4; PP. 319-328; BIBL. 8 REF.Article

A SIMPLE TECHNIQUE FOR COMPUTING NETWORK RELIABILITY = UNE TECHNIQUE SIMPLE POUR LE CALCUL DE LA FIABILITE D'UN RESEAUAHMAD SH.1982; IEEE TRANS. RELIAB.; ISSN 0018-9529; USA; DA. 1982; VOL. 31; NO 1; PP. 41-44; BIBL. 6 REF.Article

FINDING THE VERTEX CONNECTIVITY OF GRAPHSGALIL Z.1980; S.I.A.M. J. COMPUTG; USA; DA. 1980; VOL. 9; NO 1; PP. 197-199; BIBL. 6 REF.Article

SUR LA NOTION D'ADJOINT AUX GRAPHES ORIENTES ET AUX GRAPHES NON ORIENTESCHIAPPA PA.1979; R. C. MAT.; ITA; DA. 1979; VOL. 12; NO 1; PP. 85-104; ABS. ENG; BIBL. 37 REF.Article

COLORING AND INTERPRETATIONS: A CONNECTION BETWEEN GRAPHS AND GRAMMAR FORMSMAVRER HA; SALOMAA A; WOOD D et al.1981; DISCRETE APPL. MATH.; ISSN 0166-218X; NLD; DA. 1981; VOL. 3; NO 2; PP. 119-135; BIBL. 11 REF.Article

JOINTS ET DECOMPOSITIONS PREMIERES DANS LES GRAPHES.MAURER VILAREM MC.1977; ; S.L.; DA. 1977; PP. (75P.); BIBL. 2 P.; (THESE DOCT. 3EME CYCLE, SPEC. MATH. APPL., MENTION INF.; PIERRE ET MARIE CURIE PARIS VI)Thesis

SEQUENTIAL EVALUATION OF TERMINAL PAIR RELIABILITY IN A RELIABILITY NETWORKSANTOSH KUMAR.1982; MICROELECTRON. RELIAB.; ISSN 0026-2714; GBR; DA. 1982; VOL. 22; NO 2; PP. 151-162; BIBL. 15 REF.Article

TWO-COMMODITY FLOWITAI A.1978; J. ASS. COMPUTG MACHIR.; USA; DA. 1978; VOL. 25; NO 4; PP. 596-611; BIBL. 14 REF.Article

VARIATION OF SPATIAL CUES IN NODE ARRANGEMENTBEAZLEY WG; ALLAN JJ III.1980; IEEE TRANS. SYST. MAN CYBERN.; ISSN 0018-9472; USA; DA. 1980; VOL. 10; NO 12; PP. 920-924; BIBL. 16 REF.Article

ACYCLIC AND TOTALLY CYCLIC ORIENTATIONS OF COMBINATORIAL GEOMETRIES.LAS VERGNAS M.1977; DISCRETE MATH.; NETHERL.; DA. 1977; VOL. 20; NO 1; PP. 51-61; BIBL. 17 REF.Article

COMPLEXITY OF NETWORK RELIABILITY COMPUTATIONSBALL MO.1980; NETWORKS; USA; DA. 1980; VOL. 10; NO 2; PP. 153-165; BIBL. 14 REF.Article

MAXIMIZATION OF THE VECTOR-FLOW IN MULTICOMMODITY NETWORKSANEJA YP; AGGARWAL V; NAIR KPK et al.1979; INFOR; CAN; DA. 1979; VOL. 17; NO 3; PP. 276-286; ABS. FRE; BIBL. 10 REF.Article

UNE GENERALISATION DU THEOREME DE RICHARDSON SUR L'EXISTENCE DE NOYAUX DANS LES GRAPHES ORIENTESDUCHET P; MEYNIEL H.1983; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1983; VOL. 43; NO 1; PP. 21-27; BIBL. 4 REF.Article

FREIGMSSELEKTION UND -KATALOGISIERUNG DURCH TYPISIERUNG VON MERKMALSFOLGEN = SELECTION ET CATALOGUAGE D'EVENEMENTS PAR TYPISATION DE SERIES DE FAITSSCHMIDT H; LENNERS D.1982; GERLANDS BEITRAEGE ZUR GEOPHYSIK; ISSN 0016-8696; DDR; DA. 1982; VOL. 91; NO 6; PP. 509-517; ABS. ENG; BIBL. 2 REF.Article

A RELATIONSHIP BETWEEN TRIANGULATED GRAPHS, COMPARABILITY GRAPHS, PROPER INTERVAL GRAPHS, PROPER CIRCULAR-ARC GRAPHS, AND NESTED INTERVAL GRAPHSSKRIEN DJ.1982; J. GR. THEORY; ISSN 0364-9024; USA; DA. 1982; VOL. 6; NO 3; PP. 309-316; BIBL. 11 REF.Article

GRAPH FOR CONE PRESERVING MAPSBARKER GP; BIT SHUN TAM.1981; LINEAR ALGEBRA & APPL.; ISSN 0024-3795; USA; DA. 1981; VOL. 37; PP. 199-204; BIBL. 4 REF.Article

HOMORPHISMS OF GRAPHS AND THEIR GLOBAL MAPSNASU M.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; VOL. 108; PP. 159-179; BIBL. 16 REF.Conference Paper

SIGN SOLVABLE GRAPHSMAYBEE JS.1980; DISCRETE APPL. MATH.; NLD; DA. 1980; VOL. 2; NO 1; PP. 57-63; BIBL. 5 REF.Article

ZUR VORGABE GERICHTETER KANTEN VON VERLEICHBARKEITSGRAPHEN. KLAUS WAGNER ZUM 70. GEBURTSTAGE GEWIDNET = LE PROBLEME D'ORIENTATION DANS L'AVANCE DES ARETES D'UN GRAPHE DE COMPARABILITEBURSCHEID HJ.1979; MATCH. NACHR.; DDR; DA. 1979; VOL. 91; PP. 321-325; BIBL. 10 REF.Article

A METHOD FOR FINDING THE STRONGLY CONNECTED COMPONENTS OF A DIGRAPHMARCU D.1979; AN. STI. UNIV. "AL. I. CUZA" IASI, 1A; ROM; DA. 1979; VOL. 25; NO 2; PP. 417-418; BIBL. 6 REF.Article

CHARACTERIZATIONS OF GRAPHS HAVING ORIENTATIONS SATISFYING LOCAL DEGREE RESTRICTIONS.ENTRINGER RC; TOLMAN LK.1978; CZECHOSL. MATH. J.; CZECHOSL.; DA. 1978; VOL. 28; NO 1; PP. 108-119; ABS. RUSSE; BIBL. 1 P.Article

DEGREE SETS FOR DISGRAPHS.CHARTRAND G; LESNIAK L; ROBERTS J et al.1976; PERIOD. MATH. HUNGAR.; HONGR.; DA. 1976; VOL. 7; NO 1; PP. 77-85; BIBL. 1 REF.Article

GRAPHES SANS CIRCUIT ET ORDRES TOTAUX.HABIB M.1976; IN: ANAL. APPL. INF. JOURN. COMB. INF.; BORDEAUX; 1975; BORDEAUX; UNIV. BORDEAUX I; DA. 1976; PP. 189-199; ABS. ANGL.; BIBL. 3 REF.Conference Paper

A NOTE ON REMOVING A POINT OF A STRONG DIGRAPHHORAK P.1983; MATH. SLOV.; ISSN 0139-9918; CSK; DA. 1983; VOL. 33; NO 1; PP. 85-86; ABS. RUS; BIBL. 6 REF.Article

THE CONJUNCTION OF CAYLEY DIGRAPHSKEATING K.1982; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1982; VOL. 42; NO 2-3; PP. 209-219; BIBL. 8 REF.Article

  • Page / 216